Tower of Hanoi puzzle
From Psy3241
(Difference between revisions)
| Line 1: | Line 1: | ||
[[Category:Neuropsychological methods]] | [[Category:Neuropsychological methods]] | ||
| - | + | The Tower of Hanoi is a mathematical puzzle which consists of three pegs and a number of pegs | |
| + | laying on one of the pegs in the order of largest to smallest from bottom to top. The object | ||
| + | of the puzzle is to move all the pegs from one peg on one side to the third peg opposite the | ||
| + | original one. However, you have to obey three specific rules: | ||
| + | 1. Only one disk may be moved at a time. | ||
| + | 2. 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. | ||
| + | 3. No disk may be placed on top of a smaller disk. | ||
Revision as of 00:29, 25 April 2008
The Tower of Hanoi is a mathematical puzzle which consists of three pegs and a number of pegs
laying on one of the pegs in the order of largest to smallest from bottom to top. The object
of the puzzle is to move all the pegs from one peg on one side to the third peg opposite the
original one. However, you have to obey three specific rules:
1. Only one disk may be moved at a time.
2. 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.
3. No disk may be placed on top of a smaller disk.
