Ханойская башня
Играть дальше
Смотреть все →
Об игре
Tower of Hanoi is the puzzle mathematicians cannot stop teaching with. Shift the entire stack to the rightmost peg, one disc per move, and never rest a big disc on a small one. Each level adds a disc — the minimum move count doubles every time.
Как играть
Tap a peg to lift its top disc, tap another peg to drop it.
Советы и хитрости
- Level 1 shows MIN 7 moves, and the minimum doubles plus one every level, so the 8-disc finale demands 255 taps if you never waste one.
- Solve recursively: move the n-1 discs above the base to the spare peg, drag the biggest disc to its goal, then rebuild the small stack on top.
- With an odd disc count start by sending the smallest disc straight to the right-hand goal, with an even count send it to the middle peg first.
- Every move above the MIN readout subtracts 10 points from your clear bonus, so scan the whole sequence before tapping instead of improvising.
Частые вопросы
Why is the minimum exactly 2^n-1 moves?
You must clear the n-1 discs off the base to reach it, move the base once, and move all n-1 onto it again, which gives twice the previous count plus one: 7, 15, 31, up to 255 at eight discs.
The tower shook and refused my drop, is that a bug?
Nothing broke: a big disc can never rest on a small one, and your held disc keeps floating while you hunt a taller stack or an empty peg, or tap the source peg again to set it down without costing a move.
How should I plan level 4 with six discs?
Treat the top five discs as one sub-tower, shift it to the spare using the 31-move solution, place disc six on the right peg, then rebuild with another 31 moves to land exactly on the 63 shown as MIN.
