Launch
Arrange students in groups of 2. Set up a physical puzzle with 2 discs, and display this table for all to see throughout the activity:
| number of discs | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
|---|---|---|---|---|---|---|---|
| number of moves |
Ask students to read the two rules of the puzzle. Next, invite students to name which moves are possible (move the smallest disc to the middle peg) and which are not allowed (move two discs at once to the middle peg). As a class, complete the puzzle for two discs. Ask students to suggest moves to complete the puzzle in the fewest number of moves (3). Fill in the table for the number of moves needed for 2 discs. Tell students that it is now their turn to figure out the number of moves needed for different numbers of discs.
Distribute to each group objects to manipulate while solving the puzzle. Encourage groups to check in with those around them to see if anyone found a solution with fewer moves. If there is doubt that everyone understands the rules of the game, before students begin work on the rest of the questions, select a student to demonstrate why it takes 3 moves to solve the puzzle with 2 discs.
Supports accessibility for: Visual-Spatial Processing, Conceptual Processing, Organization
Activity
NoneIn the Tower of Hanoi (huh-NOY) puzzle, a set of discs sits on 1 peg, and there are 2 other empty pegs.
A move in the Tower of Hanoi puzzle involves taking a disc and moving it to another peg. There are two rules:
- Move only 1 disc at a time.
- Never put a larger disc on top of a smaller one.
You complete the puzzle by building the complete tower on any peg other than the starting peg.
- Using 3 discs, complete the puzzle. What is the smallest number of moves you can find?
- Using 4 discs, complete the puzzle. What is the smallest number of moves you can find?
- Jada says she used the solution for 3 discs to help her solve the puzzle for 4 discs. Describe how this might happen.