🔴 Riddle #108 of 240
In the Tower of Hanoi puzzle there are 64 golden disks stacked on one peg, to be moved to another peg one disk at a time, never placing a larger disk on a smaller one. If one move takes one second, roughly how long does the optimal solution take?
Think about it first. When you're ready:
About 585 billion years
The optimal solution needs 2^64 - 1 moves, about 1.8 x 10^19 seconds, which is roughly 5.85 x 10^11 years.