Tower Puzzle
Also known as Tower of Hanoi
Move the whole stack to the last peg, one disc at a time, never placing a bigger disc on a smaller one.
What is Tower Puzzle?
The Tower Puzzle is the Tower of Hanoi: three pegs, a stack of discs sorted by size, and one rule. A larger disc can never sit on a smaller one.
The fewest moves that solves n discs is 2ⁿ − 1. Calquest shows that number at the top of the board and scores you on how close you come to it.
How to play Tower Puzzle
The aim: Move the whole stack to the last peg without ever placing a bigger disc on a smaller one.
- Lift a disc. Tap a peg to pick up its top disc. Tap the same peg again to put it back.
- Drop it somewhere legal. Tap another peg to place the disc. Illegal moves are simply refused, so you cannot break the rules by accident.
- Think in halves. Move the top n-1 discs aside, move the biggest one across, then bring the rest over on top.
How scoring works
- The fewest possible moves is 2^n - 1 for n discs, shown at the top.
- Score scales with how close you get to that minimum.
- Solving in exactly the minimum pays a large bonus.
How a round ends
You win by moving every disc to the last peg. Fewer moves is a better score.
Skills it draws on
- Recursive thinking
- Planning
- Breaking a problem in half
Play it in Calquest
Tower Puzzle is one of 15 games in Calquest, a free puzzle and logic app for Android. Each game has a ladder of levels that starts gentle and keeps climbing, daily quests and streaks give you a reason to come back, and you can play as a guest with no account.
Get Calquest on Google Play