Objective: Move all the disks from the left pole to the right pole. You may only move one disk at a time and a bigger disk may not be placed on top of a smaller disk. Click on the left or right arrows to decrease or increase the number of disks. Click the restart arrow to reset the disks. Push the big red button to watch the computer solve the puzzle, you may adjust the speed at which the discs are moved.

Java is disabled

The formula for the minimum number of moves to solve this puzzle for n disks is 2^n - 1. That means for 64 disks it would take 18,446,744,073,709,551,615 moves to solve. At 2 moves per second (the default rate the computer solves this puzzle) that would be almost 300 billion years!

Source Code