Loading…
Move the whole tower, one disc at a time, never a big disc on a small one.
The puzzle Édouard Lucas brought out in Paris in 1883: a tower of wooden discs, largest at the bottom, to be moved to another peg one disc at a time, and never a larger disc on a smaller one. Four discs take 15 moves at the fewest, six take 63, and on the hard level eight discs travel across four pegs, Dudeney's old puzzle, in 33. Every day a new scattered tower, the same for everyone, has to be gathered on its peg.
Tap a peg to lift its top disc, then tap the peg to drop it on; tap its own peg to set it back. You can also drag a disc across with your finger, and on a keyboard the keys 1 to 4 pick the pegs. A disc only goes onto an empty peg or a larger disc. Bring every disc to the peg with the gold cap. The stars count your moves: three at the fewest the tower needs, two within about a quarter more, one beyond. Your score is your time from the first move, plus 5 seconds for every move beyond the fewest and 20 seconds for every hint. Lower is better. Undo is there on easy.
The Tower of Hanoi is the puzzle the French mathematician Édouard Lucas brought out in Paris in 1883, under the made-up name of "Professor N. Claus de Siam", an anagram of "Lucas d'Amiens". It came as a wooden base with three pegs and a tower of eight discs, and a story to go with it: in a great temple, priests move a tower of 64 golden discs from one diamond needle to another, one disc at a time, never a larger disc on a smaller one, and when they finish, the world ends. Played perfectly, 64 discs take 2^64 - 1 moves, over 18 billion billion: at one move a second, about 585 billion years.
The rules fit in one line: move the whole tower to the target peg, one disc at a time, and never put a larger disc on a smaller one. The fewest moves for a tower of n discs on three pegs is 2^n - 1, so every disc you add doubles the work: 4 discs take 15 moves, 6 take 63, 8 take 255.
Here easy is 4 discs on three pegs, medium 6 discs, and hard is the four-peg version Henry Dudeney set in The Canterbury Puzzles in 1907 as "The Reve's Puzzle": eight cheeses of different sizes on four stools. A fourth peg makes the tower much shorter to move, 33 moves for eight discs, but much harder to see. Every day there is also a Daily tower: six discs scattered over three pegs, the same for everyone, to be gathered on the peg with the gold cap.
Bring every disc to the peg with the gold cap.
Yes. Like every game on Play, it runs free in your browser, with no download and no account needed.
For n discs on three pegs, 2^n - 1: 15 for four discs, 63 for six. The number shown at the top of the board is the fewest for the tower in front of you, worked out by a search over every position, so it is also right for the scattered Daily tower.
Eight discs on three pegs take 255 moves, and once you know the method that is a long walk rather than a puzzle. With four pegs the same eight discs take only 33 moves, but the shortest way is far harder to find. The method was described by J. S. Frame and B. M. Stewart in 1941, and Thierry Bousch proved in 2014 that no shorter way exists for four pegs.
It lifts the disc that a shortest way home moves next, from wherever your discs stand, and lights the peg it goes to. Tap the lit peg to make the move. Each hint adds 20 seconds to your score.
Every day everyone gets the same six discs scattered over three pegs, with the same target peg, between 40 and 58 moves from home at the fewest, so times compare directly on the daily leaderboard.
Link two alike tiles with a path of up to two turns, and clear the board.
Set ramps and flip gates so every glass marble rolls into a cup of its own colour.
Read the grid. Break the clock.
Bend the beam. Wake every node.