Tower of Hanoi

Tower of Hanoi is a puzzle with three pegs and a stack of disks of different sizes. Disks start stacked in order on one peg, largest at the bottom. You may move one disk at a time, and you may never place a larger disk on a smaller one. The aim is to rebuild the full stack on another peg.

The rules are short. The thinking is deep. To move a tower of several disks, you must first move a smaller tower out of the way, then move the largest disk, then rebuild the smaller tower on top. That nested structure is an early meeting with recursion: a problem solved by solving a smaller copy of itself, with a clear base case when only one disk remains.

Students can play it as a physical or digital puzzle. Problems.cc offers both a sandbox and a demo for this topic, so children can try moves, watch illegal placements rejected, and see how a longer plan unfolds. The point for us is not entertainment alone. It is making a multi-step plan visible and discussable.

Hanoi trains planning before calculation. Primary students learn to think several moves ahead and to respect constraints under pressure. Juniors begin to notice that the same pattern repeats at every size. Intermediate students can describe the method in words, count moves, and see why the length of an optimal solution grows so quickly as disks are added.

That growth is useful teaching. Children discover that a small change in the setup can demand a large change in effort. They meet the idea that structure, not luck, controls difficulty. They also practise patience: rushing usually violates the stacking rule or undoes earlier work.

Parents sometimes ask whether classic puzzles belong in a serious maths programme. They do when the puzzle teaches transferable habits. Here those habits are decomposition, base cases, and explaining a strategy that works for any number of disks, not only the one on the table.

The topic also supports written reasoning. A child who can say, "To move n disks, move n-1 aside, move the largest, then move n-1 again," is already speaking in the language of general methods. That is closer to proof than to a one-off trick.

We start with few disks so success is possible and the pattern can appear. Students record moves, compare routes, and argue about whether a sequence is legal. Instructors ask what must happen before the largest disk can travel, rather than announcing the recursive recipe at once.

Once the group can move a small tower reliably, we step up. Three disks become four. Students predict how the plan scales. Discussion turns on structure: Which sub-goal are we solving now? What is left after the largest disk moves? The demo on Problems.cc can illustrate a clean solution after students have struggled productively, not instead of that struggle.

For intermediate students, we connect the puzzle to broader ideas: recursion as a way of organising thought, counting moves, and the difference between a working method and an optimal one. Writing still matters. We want a clear explanation of the strategy, not only a finished tower on screen.

Depth before speed stays the rule. A slow, justified plan beats a frantic click-through. Over time, Tower of Hanoi becomes one of the places where children feel that mathematics includes designing procedures, not only finding numbers.