HOME
EDIT ITEM
CMM2 LIBRARY
by
Subtitle
Version
Description
The classic Towers of Hanoi puzzle. Move a stack of discs from one tower to another, moving one disc at a time and never allowing a larger disc to lie on top of a smaller disc. You can solve the puzzle yourself, or watch the computer solve it. There are a user-selectable number of discs, up to 12. (12 discs take 4095 moves in the optimal solution!)
Download