Tower of Hanoi interactive display at the in Mexico City The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower and sometimes pluralized) is a. Windows Ce 6 0 Wm8650 Battery. Magic Views Bot Cracked Magazine. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: • Only one disk can be moved at a time. • Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack. • No disk may be placed on top of a smaller disk. With 3 disks, the puzzle can be solved in 7 moves.

The minimal number of moves required to solve a Tower of Hanoi puzzle is 2 n − 1, where n is the number of disks. Contents • • • • • • • • • • • • • • • • • • • • • • • • • Origins [ ] The puzzle was invented by the in 1883. There is a story about an temple in which contains a large room with three time-worn posts in it, surrounded by 64 golden disks. Priests, acting out the command of an ancient prophecy, have been moving these disks in accordance with the immutable rules of Brahma since that time. The puzzle is therefore also known as the Tower of puzzle. According to the legend, when the last move of the puzzle is completed, the world will end.