InkplayLess color. More play.

Tower of Hanoi

Move the whole stack to the far peg — one disk at a time.

0 playing now

How to play Tower of Hanoi

Click a peg to pick up its top disk, then click another peg to drop it. You may only place a disk onto a larger disk or an empty peg. Move the entire stack to the rightmost peg. The fewest possible moves for four disks is fifteen.

Tower of Hanoi leaderboard

Top scores — log in to compete.

  1. Loading leaderboard…

Tower of Hanoi — frequently asked questions

What is the minimum number of moves?

For n disks the minimum is 2ⁿ − 1 moves, so four disks can be solved in fifteen moves.

Is my best score the lowest move count?

Yes — fewer moves is better, so your Best shows the smallest number of moves you have used to solve it.

More black & white games

In the mood for more? Try Chess or 2048, or browse the full games list on Inkplay.