Move the whole tower. Never put a big disc on a small one.
Strong Mind Logic & Puzzle Games Maths Games for Kids (6-10) Maths Games for Juniors (11-14)
Move every disc from the left peg to the right one. You may move only the top disc of a pile, and you may never place a larger disc on a smaller one.
The minimum number of moves is 2n − 1: seven moves for three discs, fifteen for four, sixty-three for six. The puzzle is the classic illustration of recursion — to move n discs you move n−1 out of the way, move the big one, then move the n−1 back on top.
This version: Seven moves if you are perfect. Your best score is saved in this browser, so you can come back and try to beat it. Nothing is uploaded and no sign-up is needed.
2ⁿ − 1, where n is the number of discs. Three discs need 7 moves, four need 15, five need 31 and six need 63. The counter shows how close you are to optimal.
A story invented by the French mathematician Édouard Lucas in 1883, about monks moving 64 golden discs. At one move per second that would take about 585 billion years.
Yes. With an odd number of discs, always move the smallest disc one peg to the right, wrapping around; between those, make the only other legal move available. It solves the puzzle in the minimum every time.