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.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.