|
31 (another Prime Pages' Curiosity) |
|
|
Curios:
Curios Search:
Participate:
|
Single Curio View: (Seek other curios for this number) The minimal number of moves required in a Tower of Hanoi puzzle containing five discs. The general solution to this puzzle requires a Mersenne number (i.e., 2^n - 1) of moves, where n is the number of discs.
Submitted: 1999-09-02 18:40:00; Last Modified: 2009-07-22 19:39:31.
Prime Curios! © 1999-2009 (all rights
reserved)
|