Tower of Hanoi
- Developer
- Zarocer
- Published
- Oct 5, 2026
- Updated
- Oct 10, 2026
- Technology
- HTML5
- Devices
- PC, Mobile, Tablet
- Orientation
- Adaptive
- Players
- 1
About the game
A browser adaptation by Zarocer.
Move the tower to the right peg, one disk at a time. Choose three to eight disks or try the daily challenge with its shared disk count.
Controls
Click the source peg, then the destination. Keys 1, 2 and 3 choose pegs, Z undoes, H gives a hint and Escape pauses. Never place a larger disk on a smaller one.
Plan the move of the largest disk
Only the top disk of a peg can move, and a larger disk cannot land on a smaller disk. To move the largest disk to the right peg, first move all smaller disks to the middle peg. Then move the largest disk right and rebuild the smaller tower above it.
With three disks, move the smallest left to right, the middle left to middle, and the smallest right to middle. The largest disk can now move left to right. Finish by moving the smallest middle to left, the middle middle to right, and the smallest left to right: seven legal moves.
Understand the target before adding disks
The minimum from the classic starting position is 2ⁿ − 1 moves for n disks: seven for three disks and fifteen for four. This bound describes the complete starting puzzle; it is not the number of moves remaining from every intermediate position.
This build offers three to eight disks. Its daily challenge shares a disk count based on the UTC date and uses the classic starting arrangement. The native hint can suggest a shortest next move from your current position, including after a detour. Undo changes the board; use pause when you need a break from the active timer.
Save and continue
ZAROCER opens the game in English. Progress and records stay in this browser when storage is available. After a reload, use the native continuation or resume controls. Clearing site data can remove your save. Pause, Theater and Fullscreen keep the same game instance.
Tower of Hanoi gameplay screenshots























