Tower of Hanoi
Library Home || Full Table of Contents || Library Help
|Math Forum, a Classic Problem from the Ask Dr. Math FAQ|
|There are three posts. Disks of different sizes are placed on the lefthand post, arranged by size with the smallest on top. You are to transfer all the disks to the righthand post in the fewest possible moves, without ever placing a larger disk on a smaller one. How many moves will it take to transfer n disks from the left to the right post?|
|Levels:||Elementary, Middle School (6-8), High School (9-12)|
|Resource Types:||Games, Problems/Puzzles|
|Math Topics:||Equations, Patterns/Relationships, Discrete Math|
© 1994- The Math Forum at NCTM. All rights reserved.