Tower of Hanoi puzzle
From Psy3242
(Difference between revisions)
Bchristian (Talk | contribs) |
Bchristian (Talk | contribs) |
||
| Line 7: | Line 7: | ||
The goal of the puzzle is to move the entire stack of disks to another peg. There are some rules to follow: | The goal of the puzzle is to move the entire stack of disks to another peg. There are some rules to follow: | ||
| - | + | - Only one disk may be moved at a time. | |
| - | + | - No disk may be placed on top of a smaller disk. | |
Play [http://www.raptivity.com/Demo%20Courses/Interactivity%20Builder%20Sample%20Course/Content/Booster%20Pack/HTML%20Pages/Towers%20of%20Hanoi.html Tower of Hanoi] | Play [http://www.raptivity.com/Demo%20Courses/Interactivity%20Builder%20Sample%20Course/Content/Booster%20Pack/HTML%20Pages/Towers%20of%20Hanoi.html Tower of Hanoi] | ||
Revision as of 00:14, 24 April 2008
The Tower of Hanoi (sometimes known as Tower of Brahma) is a mathematical game or puzzle. It consists of three pegs, and a different number of varying sized disks which slide onto any peg. 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 goal of the puzzle is to move the entire stack of disks to another peg. There are some rules to follow:
- Only one disk may be moved at a time.
- No disk may be placed on top of a smaller disk.
Play Tower of Hanoi
