Tower of Hanoi

An ancient puzzle, the Tower of Hanoi is a test of logic and strategy. The object is to move all 8 discs from the peg farthest to the left to the peg farthest to the right. You must stack them in order from largest at the bottom to smallest at the top, BUT you can only move one disc at a time and you cannot put a larger disc on top of a smaller disc. This has been a favorite puzzle in my classroom, with both third graders and fourth graders; they love the challenge as well as the perseverance that it requires. And once they solve it, they love it so much that they keep going back to it in order to try to get faster and more efficient in solving the puzzle.


Submit a Comment

Your email address will not be published. Required fields are marked *

Copyright © BookSmart Math