🧩 Tower of Hanoi
<p>The ancient temple puzzle of disks and rods that quietly teaches recursion, recreated with crisp, colourful pieces. Tower of Hanoi is the ancient Tower of Hanoi: move a stack of graded disks to another rod, never placing a larger disk on a smaller one. Under the surface it's quietly training recursion, sequencing and pattern recognition. Because every session is brief but begs for 'just one more go', it's become a reliable daily habit for puzzle lovers. Wherever you play from, the experience stays fast, fair and frustration-free. Free to play and ready in a tap, it works the same whether you're on a laptop or a phone on the bus. There are no timers forcing you to rush unless the game itself adds one, so you can play at your own thoughtful pace. Controls are dead simple to learn but the depth keeps revealing itself the more you play. It sits comfortably alongside the other thinky games in our collection if you fancy a change of pace.</p>
How to play
- Tap a rod to pick up its top disk.
- Tap another rod to place the disk down.
- A bigger disk may never sit on a smaller one.
- Move the entire stack to the right-hand rod.
- Aim for the minimum number of moves.
Controls
Tap a rod to lift its top disk, then tap another rod to drop it. Larger disks can never rest on smaller ones.
Features
- Choose your disk count for rising difficulty
- Optimal-move target to chase
- Clean, colourful disks
- A perfect introduction to recursive thinking
FAQ
For n disks it is 2ⁿ − 1 — for example 15 moves for four disks.