Tower of Hanoi is a classic mathematical puzzle invented in 1883. You start with a neat stack of disks on the left peg, largest at the bottom, and your job is to rebuild the same stack on the right peg. You may move only one disk at a time, only the top disk of a peg, and you may never rest a larger disk on a smaller one. The puzzle looks simple with three disks but the number of moves needed doubles with every disk you add, so it quickly becomes a real test of planning ahead. It is a favourite in maths and computer-science classrooms because the shortest solution follows a beautiful recursive pattern.
For a tower of n disks the minimum is 2 to the power n, minus one. So 3 disks need 7 moves, 4 disks need 15, 5 need 31, 6 need 63 and 7 need 127. Matching that count earns the top score for the level.
Each level rewards points for the number of disks, scaled by how close you get to the fewest possible moves. Solving every level with no wasted moves gives the maximum score.
Yes. Tower of Hanoi builds planning, sequencing and recursive thinking, which is why it appears in maths and computer-science lessons and in cognitive tests.