Report as inappropriate.
The famous "Towers of Hanoi" puzzle, with a solver if you can't work out how to complete it!
Here's the rules (copied from Wikipedia):
The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:
- Only one disk may be moved at a time.
- Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
- No disk may be placed on top of a smaller disk.
4832 views / 672 in the last 7 days
6 votes | 0 in the last 7 days
To embed this scenario in a web page, copy the following HTML code:
Want to leave a comment? You must first log in.