Curated OER
The Tower of Hanoi
In this Hanoi problem, students explore the movement of eight circular discs fastened to a stand, all of different sizes. Students find the smallest number of moves necessary to stack the discs from the largest to the smallest. The...