Most toy versions of the puzzle have 8 disks. The Flag Tower of Hanoi may have served as the inspiration for the name. In some versions, other elements are introduced, such as the fact that the tower was created at the beginning of the world, or that the priests or monks may make only one move per day. The temple or monastery may be said to be in different parts of the world - including Hanoi, Vietnam, and may be associated with any religion. For instance, in some tellings, the temple is a monastery and the priests are monks. There are many variations on this legend.

(In context, the universe is currently about 13.7 billion years old.) If the legend were true, and if the priests were able to move disks at a rate of one per second, using the smallest number of moves, it would take them 2 64в€’1 seconds or roughly 600 billion years (operation taking place is ). The Tower of Hanoi is a problem often used to teach beginning programming, in particular, as an example of a simple recursive algorithm. It is not clear whether Lucas invented this legend or was inspired by it. 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 priests of Brahma, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the rules of the puzzle. 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. The puzzle was invented by the French mathematician Г‰douard Lucas in 1883.

6.1 Description of the presumed-optimal solution.

2.2.3 Solution from an arbitrary initial configuration.

No disk may be placed on top of a smaller disk.

Each move consists of taking the upper disk from one of the pegs and sliding it onto another peg, on top of the other disks that may already be present on that peg.

The objective of the puzzle is to move the entire stack to another peg, obeying the following rules: The puzzle starts with the disks neatly stacked in order of size on one peg, the smallest at the top, thus making a conical shape. It consists of three pegs, and a number of disks of different sizes which can slide onto any peg.

The Tower of Hanoi or Towers of Hanoi is a mathematical game or puzzle. A model set of the Towers of Hanoi (with 8 disks) File:Tower of Hanoi 4.gifДЄn animated solution of the Tower of Hanoi puzzle for T(4,3).

Lady popular hanoi towers esay