Tower of Hanoi

Tower of Hanoi is a mathematical puzzle that is more than a century old. A stack of discs sits on the left peg, largest at the bottom. Move the whole stack to the right peg, one disc at a time, using the middle peg as a spare. A larger disc may never rest on a smaller one.

You begin with three discs, which takes seven moves at best. Each tower you finish adds a disc, up to seven, and every extra disc roughly doubles the work: the fewest moves needed is always two to the power of the number of discs, minus one. The counter shows your moves beside the best possible.

Move all discs to the Goal peg. Only the top disc of a peg can move, and it can only go onto an empty peg or a larger disc.