Classic Problem - Tower of Hanoi

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

In this problem, you will be working on a famous mathematical puzzle called The Tower of Hanoi. There are three pegs, and on the first peg is a stack of discs of different sizes, arranged in order of descending size. The object of the game is to move all of the discs to another peg. However, only one disc can be moved at a time, and a disc cannot be placed on top of a smaller disc.

This interactivity shows the most efficient way of moving the discs from one end to the other:

Full Screen Version
If you can see this message Flash may not be working in your browser
Please see to enable it.

Explain how you could work out the number of moves needed for the Tower of Hanoi puzzle with $n$ discs.

There is a legend that a 64-disc version of the Tower of Hanoi is being played out in a temple, and when the final move is made, the world will come to an end. If one move is made each second, how long would it take to complete the game with 64 discs? Do we need to worry yet, if the first disc was moved at the very beginning of time?