Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Tower of Hanoi

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://mathforum.org/dr.math/faq/faq.tower.hanoi.html
Author:Math Forum, a Classic Problem from the Ask Dr. Math FAQ
Description: 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)
Languages: English
Resource Types: Games, Problems/Puzzles
Math Topics: Equations, Patterns/Relationships, Discrete Math

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.