![]() |
What is the famous Tower of Hanoi problem?In: Games and Toys |
[Edit] |
Answer
If you love puzzles, mathematics, or computer programming then the "Tower of Hanoi" problem is brain teaser designed just for you.
At first glance, the Tower of Hanoi problem appears to be a simple matter of trial and error. The problem consists of three wooden pegs. The center wooden peg contains 8 discs of varying size. The discs decrease in diameter from the bottom to top. For example, the bottom disc could be 8 inches in diameter and the disc on top of it could be 6 inches in diameter. Place a 4 inch disc on top of that followed by a 2 inch disc on the very top. At the beginning of the problem, the two remaining pegs do not contain any discs.
The goal of the Towers of Hanoi problem is to move all the discs from the center peg to one outside peg. Sounds easy, right? There are two rules that you must follow. Rule #1 is that you can move only one disc at a time. Rule #2 is that you can not place a larger disc on top of a smaller disc. This is the reason why there are three pegs in the problem as opposed to just two pegs.
First answer by JillianG. Last edit by JillianG. Contributor trust: 332 [recommend contributor]. Question popularity: 79 [recommend question]





