Set up the board and rules

Draw three spaces on a sheet and label them A, B and C. Prepare three different-sized cardboard pieces called small, medium and large. Stack them on A, largest at the bottom and smallest at the top. The aim is to move the complete stack to C, using B as a spare position.

Advertisementpreview

A move transfers only the top piece of a stack. A piece may be placed on a larger piece. The central rule prevents placing a piece on a smaller one. An empty space can receive any piece that is free at the top of a stack. These are the conditions for the classic three-position version. Wolfram MathWorld, puzzle rules.

Begin with a two-disk tower

Set the largest piece aside and use only small and medium for the first challenge. Move small from A to B, medium from A to C, then small from B to C. The two-disk tower reaches its destination in three moves. Return to the start and ask your partner to explain why small had to move first.

Swap the jobs of moving and checking the rules. The observer points to the free top piece and the place allowed to receive it. If an attempted move is invalid, keep the board as it was and explain which rule prevented that move. Then choose another legal possibility together. Sharing the explanation helps both participants follow the reasoning.

Check seven moves with three disks

Put the full stack back on A. Follow the table slowly, completing one row at a time. After every move, check the positions of all three pieces before continuing. Use the same disk names and position letters throughout the record so another pair can follow it.

StepPieceFromTo
1SmallAC
2MediumAB
3SmallCB
4LargeAC
5SmallBA
6MediumBC
7SmallAC

After step three, the two smaller disks are together on B. Step four moves large. The final three steps transfer the smaller tower from B to C. This division reveals a structure inside the move list and gives the unit a way to explain what each part accomplishes.

Read alsoHow to make a three-strand braid and check the sequence for the Braiding honor

Explain three, one and three

Large begins covered by two pieces. To move it directly from A to C, the two smaller disks must be arranged on B. The two-disk problem needs three moves. Next comes one move of large, followed by three more to rebuild the smaller tower on top. The calculation is 3 + 1 + 3 = 7.

Advertisementpreview

This reasoning introduces recursion, where a problem uses a smaller version of the same kind of problem to reach its solution. It appears in mathematical investigations of the puzzle. The group can color-code the table’s stages, using one color for preparation, one for moving large and one for finishing. NRICH, Tower of Hanoi patterns.

Add one piece and predict the work

With a new large piece at the base, first move the three-disk tower to the spare position, transfer the new base, then rebuild the tower on top. The corresponding count is 7 + 1 + 7 = 15. The minimum counts for three positions follow a pattern of doubling the previous total and adding one. Wolfram MathWorld, puzzle investigation.

Before assembling four disks, ask for a prediction of the work involved. A pair can draw the three stages and write fifteen as its target. Saving the reasoning allows the unit to return at another meeting without relying on memorizing a long move list for every possible tower size.

Present a solution someone can follow

One person reads the moves while another performs them. Swap roles afterward and explain the stages. The unit’s report can keep the table, a board drawing and a sentence describing what each stage solves. The activity then develops planning and communication alongside its mathematical discovery, and another pair has a clear record to check for itself.

Words in this guide

recursion · Solving a problem using a smaller version of the same kind of problem. Back to the term