Sign inSign in
ConceptSystems & CS

Recursive move tower algorithm

A recursive procedure that solves the Tower of Hanoi problem by moving a tower of height N minus 1 to the spare, printing the move of the base disk, and then moving the tower from the spare to the destination.
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.

Conditional expression1Recursion1Tower of Hanoi problem setup1

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    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.