Just Hanoi · Tower puzzle

About

Just Hanoi is the classic Tower of Hanoi — the puzzle every algorithms textbook starts with — rendered as a quiet wooden toy. Three pegs. A stack of colored discs. One rule: a larger disc may never sit on a smaller one. Move the whole stack from the left peg to the right peg. The puzzle is over 140 years old. It still works because it teaches you to think recursively — without ever using the word. WHAT'S INSIDE — Eight levels: 1 disc through 8 discs. The smallest solves in 1 move; the largest takes 255. — A "Show me how" button. Tap it and watch the optimal solution play out. Pause it, copy what you saw on your own. Use it as much or as little as you want — it's a teaching tool, not a cheat. — A tiny hint at each new level introduces the recursive idea behind it. After you've seen it once, it doesn't appear again. — Move counter and optimal move count, side by side. Match the optimum and the game says so. — Unlimited undo. There is no failure state — only learning. NO INTERRUPTIONS — No ads. Anywhere. Ever. — No accounts. No data collection. The app doesn't even know you exist. — No timer. No streak. No notifications. — Works fully offline. Played once, played always. FOR WHOM — Anyone meeting recursion for the first time — students, programmers, curious adults. — Parents and kids playing together. The rules are explained in three short rules at the start. — Teachers who want a 5-minute classroom example of an algorithm that solves itself. — Anyone who likes the feel of moving a wooden disc onto a wooden peg. PART OF JUST PLAY Just Hanoi is the fifth game in the Just Play series, after Just Sudoku, Just Puzzle, Just Yin Yang, and Just Stack. Each is a single classic puzzle, alone, with no clutter. LANGUAGES Localized into 34 languages — every language the App Store supports. PRIVACY Just Hanoi collects no data. None. It uses the device's local settings only to remember which level you reached and which teaching hints you've already seen, so they don't appear twice.