Name: Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
Uploaded: 2013-01-14T20:26:39Z
Duration: 52 min 47 s
Description: Description: This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph. Instructor: Victor Costan

52:47

Description: This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph.

Instructor: Victor Costan