Game Tower of Hanoi or Tower of Brahma
Online
The task is to move a pyramid of eight (or fewer) rings in the fewest number of moves to another rod.
You are allowed to move only one disk at a time, and you cannot place a larger disk on a smaller one.
Moves done : 0
To move the top disk, click on the disk, then click on the pole you want to move the disk to.
View example
Minimum possible number of moves if selected:
3 disks = 7
4 disks = 15
5 disks = 31
6 disks = 63
7 disks = 127
8 disks = 255
4 disks = 15
5 disks = 31
6 disks = 63
7 disks = 127
8 disks = 255
Tower of Hanoi (or Brahma's Tower) is one of the popular puzzles of the 19th century. There are three rods, one of which has eight disks strung on it, and the disks differ in size and lie smaller on larger.
The Legend of Brahma's Tower
A made-up legend says that in the Great Temple of Benares, under the cathedral that marks the middle of the world, there is a bronze disk on which are fixed 3 diamond rods, one cubit high and as thick as a bee. Long ago, at the very beginning of time, the monks of this monastery sinned before the god Brahma. The angry Brahma erected three tall rods and placed 64 disks made of pure gold on one of them. Moreover, each smaller disk lay on the larger one.As soon as all 64 disks are transferred from the rod on which Brahma placed them when creating the world to another rod, the tower and temple will turn to dust and the world will perish under the peals of thunder.
The number of transfers depending on the number of rings is calculated by the formula 2n-1.
The number of ring movements that the monks must make is 18,446,744,073,709,551,615. If the monks, working day and night, made one disk movement every second, their work would continue for almost 585 billion years.
