ConceptTheory & Algos
Dynamic programming for dance dance Revolution
An algorithmic approach to find the optimal sequence of moves in DDR that either maximizes score or minimizes total effort.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Dynamic programming1Graph modeling1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.