|
Program
Features |
Animations
|
Illustrations
|
Inter-Activities
|
Scans
and Images
|
|
Tower of Hanoi Puzzle
|
||||
Transfer all of the disks to one of the other pegs. Only 1 disk may be moved at a time, and a larger disk may not be placed on top of a smaller disk. The patient H.M. learned to do this, but retains no memory of having performed it before. The optimal solution to this puzzle is 63 moves.