The Tower of Hanoi looks like a game with an old tradition, but it was made at the end of the 19th century. It was devised by the French mathematician Édouard Lucas (1842 to 1891).
A Puzzle Sold in 1883 Under a Pseudonym
The Tower of Hanoi went on sale in France in 1883. The name of the creator on the box was “Professor N. Claus de Siam”. This was Lucas’s playfulness: rearrange the letters of “Claus de Siam” and you get “Lucas d’Amiens” (Lucas of Amiens). Amiens is the town where Lucas was born.
Lucas is a mathematician known for his research on the “Lucas numbers”, which resemble the Fibonacci numbers, and on ways to check whether a large number is prime. He was also keen on games for enjoying mathematics, and introduced many puzzles and number games besides the Tower of Hanoi.
The Legend of the 64 Golden Disks
The Tower of Hanoi spread with a legend like this attached.
In a temple in Benares, India, three diamond needles stand, and on one of them are stacked 64 golden disks. The monks keep moving the disks, day and night without rest, according to the rules. When they have moved all the disks, the world will end.
This legend is thought to have been made around the time the puzzle went on sale, not to be an old tradition. Even so, if you calculate how long it takes to move 64 disks, you find that the legend is not exaggerated at all (How Many Years Would 64 Disks Take?).
Why “Hanoi”?
Hanoi is the capital of Vietnam, but no connection between the puzzle itself and Vietnam is known. At the time it went on sale, France was expanding into northern Vietnam. It is thought that the name was chosen because it had a faraway, exotic sound. Because the legend is set in India, it is sometimes called the “Tower of Brahma”.
A Variation with Four Poles
What happens if you add a fourth pole? The English puzzle writer Henry Dudeney introduced this problem in his 1907 book as “The Reve’s Puzzle”. With just one more pole, the number of moves drops sharply.
But for a long time, no one could prove how to find the fewest moves with four poles. Whether the commonly used method (the Frame–Stewart method) is really the fewest was finally shown only in 2014. With three poles one formula is enough, but with four it became a difficult problem lasting over 100 years. The details are in The Tower of Hanoi with Four Poles.
A deep mathematical problem hides in a game of just small poles and disks. That may be one reason the Tower of Hanoi has kept being played for over 140 years.
