The temple or monastery may be in various locales including Hanoi, 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. 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 585 billion years to finish, which is about 42 times the estimated current age of the universe. But, this story of Indian Kashi Vishwanath temple was spread tongue-in-cheek by a friend of Édouard Lucas. Numerous myths regarding the ancient and mystical nature of the puzzle popped up almost immediately, including a myth about an Indian temple in Kashi Vishwanath containing 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. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2 n − 1, where n is the number of disks.

With three disks, the puzzle can be solved in seven moves. No disk may be placed on top of a disk that is smaller than it.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules: The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle ) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod.

A model set of the Tower of Hanoi (with 8 disks) An animated solution of the Tower of Hanoi puzzle for T(4, 3) Tower of Hanoi interactive display at Mexico City's Universum Museum Algodoo solving the hanoi tower

$tower stacking puzzle$

For the Vietnamese skyscraper, see Keangnam Hanoi Landmark Tower. So, if it says X > Y, X > B, for instance, then you should press X, then Y, then wait a second, then press X, then B, and so on.This article is about the mathematical disk game. The inputs are in pairs, with one 'picking up' a disc, and the other moving it to a new position. If you're in a hurry, we've got the fastest solution to the puzzle listed as button inputs, covering all platforms you can play Mass Effect on. If at any time you get stuck on the puzzle, press the Interact button (A on Xbox, X on PlayStation) to quit out, letting you start again.

Tower stacking puzzle