Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path

Published: Dec. 10, 2012, 5:37 p.m.

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