Game prompts for a selection of game modes; easy, normal, and insane. Make a selection.
Game begins with all the disk starting from the first box and only ends with all disks placed in the last box.Objective is to move all items from first box to the last under 3 conditions:
- No disk can be placed over a bigger one.
- Moved only ONE at a time.
- Only the top disk can be removed from each box.
Background
"The tower of Hanoi (also called the tower of Brahma or the Lucas tower) was invented by a French mathematician Édouard Lucas in the 19th century. It is associated with a legend of a Hindu temple where the puzzle was supposedly used to increase the mental discipline of young priests. In the legend the young priests were given 64 gold disks stacked neatly on one of three posts. Each disk rested on a slightly larger disk. The priests' goal was to re-create the stack on a different post by moving disks, one at a time, to another post with the rule that a larger disk could never be placed on top of a smaller disk. Using mathematics, you can calculate that even when the priests found the most efficient way to solve the problem, and moved the disks at a rate of one per second, it would take almost 585 billion years to finish the job. That is more than 40 times the age of the universe!"
--source https://www.scientificamerican.com/article/the-tower-of-hanoi/