๐ผ Tower of Hanoi
๐ง Discovery and thinking ยท Logic๐ Year 3 โ Year 6
Move the whole tower to the last peg. Move one disk at a time, and never put a big disk on a small one!
Moves: 0 ยท Fewest possible: 7
About โTower of Hanoiโ
An old math puzzle: all the disks are on the first peg and you must move them to the last one. Only the top disk can be moved, and a disk can never go on a smaller one.
Three disks take seven moves, and five need thirty-one. When a child works out the method alone, they have understood the idea of a recursive solution without ever hearing the word.