Towers of Hanoi
The objective of the puzzle is to move the entire stack to another rod, obeying the following rules. Enjoy Playing!
- Move the entire stack from the middle rod to the left rod in the same order. Use right rod as an aid for temporary holding of stacks.
- 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.
If you find it hard to solve 'towers of hanoi' problems in either level, please feel free to explore our How to Solve article. For information about the applications of 'towers of hanoi' puzzle, please explore this article. For information on different variants of 'towes of hanoi' as played today, please read this article. Graphical Representation of 'towers of hanoi' puzzle can be found here. If you are interested in algorithms of General Shortest paths read this article.
Did you know! There is a legend about an Indian temple which contains a large room with three time-worn posts in it surrounded by 64 golden disks. Brahmin priests, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the rules of the puzzle, since that time. The puzzle is therefore also known as the Tower of Brahma puzzle. According to the legend, when the last move of the puzzle is completed, the world will end. The puzzle was first publicized in the West by the French mathematician Edouard Lucas in 1883. It is not clear whether Lucas invented this legend or was inspired by it.
