 |
18433 (another Prime Pages' Curiosity) |
|
|
|
Curios:
Curios Search:
Participate: 
|
The number of moves required to move 64 disks from one peg
to another in the tower of Hanoi problem using FOUR pegs. [Bos]
To link to this page use http://primes.utm.edu/curios/page.php?number_id=11051
Prime Curios! © 1999-2013 (all rights
reserved)
|