Tower of Hanoi
Tower of Hanoi with 3 to 10 disks, the 2^n - 1 minimum shown, hints, unlimited undo and an animated auto-solve from any position.
🔒 Your data stays in your browser: nothing you type or upload is sent to a server.
Tower of Hanoi with 3 to 10 disks, the 2^n - 1 minimum shown, hints, unlimited undo and an animated auto-solve from any position.
🔒 Your data stays in your browser: nothing you type or upload is sent to a server.
Move the whole stack from the left peg to the right peg, one disk at a time, never putting a disk on a smaller one. Choose 3 to 10 disks. The fewest possible moves, 2^n - 1, is always shown next to your count, and the records table keeps your lowest count per size. The hint gives the next move of the shortest route from where you are, and Auto-solve plays that route as an animation at three speeds. The solver works from any legal position, not only the start, so you can wreck the tower and still ask for the fastest way out.
To move the largest disk you must first stack all the others on the spare peg, then move the largest disk once, then move the others back on top. That gives T(n) = 2 T(n-1) + 1 with T(1) = 1, which is 2^n - 1: 7 moves for 3 disks, 1023 for 10.
No. Using the hint or auto-solve marks the game as assisted, so it is never saved as a record, although it still shows your move count.