Sign inSign in

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.
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.