How to play DiskDrift
DiskDrift is a free browser logic puzzle based on the Tower of Hanoi — a mathematical challenge first published by Édouard Lucas in 1883. Three pegs hold a tapered stack of disks. Tap a peg to lift its top disk, then tap another peg to drop it. Two rules bind you: move only one disk at a time, and never place a larger disk on top of a smaller one. Win by rebuilding the entire tower on the glowing target peg.
The catch is that every small move ripples outward — to free the biggest disk you must first park everything above it on the spare peg, which forces the same problem one layer down. That recursion is why an n-disk tower always takes exactly 2n−1 moves when played perfectly: 7 moves for 3 disks, 127 for 7, and a marathon 255 for 8.
More like this: Logic games · Brain games
Tips & strategy
- Think in odd and even: if your tower has an odd number of disks, the smallest disk cycles toward the goal peg first; with an even count it cycles the other way.
- Never move the same disk twice in a row unless it is the smallest one — perfect solutions alternate between disks.
- Work backwards from the win: before the largest disk can cross, every smaller disk must be stacked on the single spare peg.
- Par is exact — hit it for 3 stars. Within about 30% over still earns 2 stars, so finish rather than restart.
DiskDrift FAQ
What are the rules of DiskDrift?
Move one disk at a time between the three pegs. A disk may never rest on top of a smaller disk, and the goal is to rebuild the entire tower on the glowing target peg.
How many moves does a perfect game take?
Exactly two to the power of n minus one: 7 moves for three disks, 31 for five, and 255 for eight. Finish at par for three stars.
Is DiskDrift free?
Completely free in the browser: campaign, daily tower, and free play included.