The book is now available! 18433
(another Prime Pages' Curiosity)
Prime Curios!
Curios: Curios Search:

Single Curio View:   (Seek other curios for this number)


The number of moves required to move 64 disks from one peg to another in the tower of Hanoi problem using FOUR pegs. [Bos]


  Submitted: 2011-04-03 15:16:06;   Last Modified: 2011-04-03 19:44:22.

Prime Curios! © 2000-2018 (all rights reserved)