What is the minimum number of moves?
For n discs, the minimum is 2 to the power of n, minus 1. Three discs take 7 moves, four take 15, five take 31, and six take 63.
Cozy web games
Move three to six discs from rod A to rod C. Use the spare rod to make space, and see how close you can get to the minimum move count.
Controls: Tap a rod, then tap its destination. Tap the selected rod again to cancel.
PCder pick
This page is one of the games PCder is comfortable recommending first: the controls are clear, the source trail is visible, and the game fits a desktop browser session.
Regional page
This Canada page keeps Tower of Hanoi close to the searches Canadian desktop players use. Move the whole stack without covering a smaller disc. The game stays browser based, with no installer or launcher.
Quick answer
Tower of Hanoi is a puzzle with three rods and a stack of discs. Move the stack from A to C, one top disc at a time. You cannot place a larger disc on a smaller one. This version has three to six discs, a move counter, and Undo.
How to play
Player guide
To move the largest disc to C, first move every smaller disc to B. Then move the largest disc and rebuild the smaller stack on top of it.
Common questions
For n discs, the minimum is 2 to the power of n, minus 1. Three discs take 7 moves, four take 15, five take 31, and six take 63.
Yes. Tap the source rod and then the destination. You do not need to drag small discs.
The source rod must contain a disc, and its top disc must be smaller than the top disc on the destination. An empty destination is also allowed.
Yes. This is an original PCder game under the MIT license. Links to the source files and license appear below the puzzle.
There is no timer or saved progress. Reloading starts a new three-disc puzzle.
Yes. The Canada page keeps Tower of Hanoi in a desktop browser format with no installer, clear controls, and source notes. A school, office, or managed network may still block access.