Peg Puzzles
The Tower of Hanoi or Towers of Hanoi is a mathematical game or puzzle. It consists of three pegs, and a number of disks of different sizes which can slide onto any peg. more...
 Home
Building Toys
Educational
Outdoor Toys & Structures
Pretend Play, Preschool
Puzzles
 1970-Now
 Brain Teasers
 $1 - $15
$15 - $30
$30 - $50
$50 - $75
$75 - $100
$100 - $200
$200 - $500
Jigsaw
100 - 249 Pieces
1000 Pieces
1001 - 1500 Pieces
250 - 499 Pieces
26 - 99 Pieces
500 Pieces
501 - 749 Pieces
750 - 999 Pieces
Mixed Lots
Over 1500 Pieces
Three-Dimensional
Under 25 Pieces
Other
Peg Puzzles
$1 - $15
$15 - $30
$30 - $50
$50 - $75
$75 - $100
$100 - $200
$200 - $500
Rubik's
$1 - $15
$15 - $30
$30 - $50
$50 - $75
$75 - $100
$100 - $200
$200 - $500
Sudoku
$1 - $15
$15 - $30
$30 - $50
$50 - $75
$75 - $100
$100 - $200
$200 - $500
Pre-1970
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.
The objective of the puzzle is to move the entire stack to another peg, obeying the following rules:
Only one disk may be moved at a time.;
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.;
No disk may be placed on top of a smaller disk.;
Origins
The puzzle was invented by the French mathematician Édouard Lucas in 1883. 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 priests of Brahma, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the rules of the puzzle. According to the legend, when the last move of the puzzle is completed, the world will end. The puzzle is therefore also known as the Tower of Brahma puzzle. It is not clear whether Lucas invented this legend or was inspired by it. The Tower of Hanoi is a problem often used to teach beginning programming, in particular, as an example of a simple recursive algorithm.
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 264−1 seconds or roughly 600 billion years (operation taking place is ![\frac{{2}^{64}}{60 \times 60 \times 24 \times 365.2425}]() .<sup id=) (In context, the universe is currently about 13.7 billion years old.)
There are many variations on this legend. For instance, in some tellings, the temple is a monastery and the priests are monks. 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. 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 Flag Tower of Hanoi may have served as the inspiration for the name.
Solution
Most toy versions of the puzzle have 8 disks. The game seems impossible to many novices, yet is solvable with a simple algorithm:
Simple solution
The following solution is a simple solution for the toy puzzle.
Read more at Wikipedia.org
|
