|
Un article trouvé pour ce sujet.
 |
|
|
|
|
|
|
|
|
Towers of Hanoi |
1999-09-03 |
|
Jeni pose la question :
In the puzzle called the Towers of Hanoi there are three peg and you are asked to move the rings from one peg and stack them in order on another peg. You can make as many moves as you want, but each move must consist of moving exactly one ring. Moreover, no ring may be placed on top of a smaller ring. The minimum number of moves required to move n rings is 1 for 1, 3 for 2 rings, 7 for 3 rings, 15 for 4 rings, and 31 for 5 rings. Find a formula for this sequence. What is the minimum number of moves required to move 6 rings?
Penny Nom lui répond. |
|
|
|
