Puzzle

🗼 Neon Hanoi

🎮 Free to play📱 Mobile + desktop⚡ No download
đŸŽ¯ Moves: 0/26✨ Perfect: 15🏆 Best: —

đŸ—ŧ Neon Hanoi

Move all 4 glowing rings from the left peg to another peg. One ring at a time, and a big ring can never sit on a small one. The perfect solve is 15 moves — your budget is 26. Think in towers, not rings.

Tap a peg to lift/drop the top ring · keys 1/2/3 or ←/→ + Space work too · a big ring can't land on a small one — invalid drops shake and don't count

How to play Neon Hanoi

Neon Hanoi is the ancient Tower of Hanoi puzzle dressed in neon. All 4 glowing rings start stacked on Peg 1, biggest at the bottom. Rebuild the whole tower on Peg 2 or Peg 3 — moving one ring at a time, and a bigger ring can never rest on a smaller one. The mathematically perfect solve is 15 moves; your run ends at 26 moves, solved or not.

Controls

Mouse / touch: tap a peg to lift its top ring, tap another peg to drop it. Keyboard: 1 / 2 / 3 select pegs directly, or ← / → to move the selector and Space to lift/drop. Illegal drops shake and don't count as moves — but tapping an empty peg also just shakes, so explore freely.

Tips & strategy

The secret is recursion: to move a tower of 4, first move the top 3 rings as one tower onto the spare peg, slide the big ring to the target, then move the 3-tower on top of it. Each 3-tower takes 7 moves — 7 + 1 + 7 = the perfect 15. Never undo a useful move: every wasted move eats your 26-move budget. If you're stuck, restart and plan the first 3 moves before touching anything.

Scoring

You win by stacking all 4 rings on another peg — fewer moves is better. Hit the perfect 15 for the special banner. Your 🏆 Best (fewest winning moves) is saved on the device. Run out of 26 moves and the tower locks — study the recursive trick and try again.