Towers of Hanoi
Topic Index | Algebra2/Trig Index | Regents Exam Prep Center
 

How to Play:

To play the Towers of Hanoi game, you must move the discs from peg A to peg B by moving one disc at a time.  A larger disc can never sit atop a smaller disc.  Peg C can be used as a holding area.

In the true problem, there are a total of 64 discs.
The number of moves needed to solve the game, based upon the number of discs in the game, can be expressed recursively.
 
represents the number of moves based upon the number of discs, n.
 

 
 
How many moves are needed to solve the Towers of Hanoi using the discs shown in the diagram at the top of this page?
 
Do you see another pattern developing in the number of moves required based upon the number of discs?