To move n disks you must first move the top n − 1 out of the way, then move the largest disk once, then put those n − 1 back on top of it. So M(n) = 2M(n − 1) + 1 with M(1) = 1, which solves to 2ⁿ − 1: eight disks need 255 moves and three need 7, on the first two links. 255 will look familiar to anyone who reads memory sizes — it is the largest value an unsigned byte holds, for exactly this reason.
Lucas's version came with sixty-four gold disks and a prophecy that the world would end when the stack had been moved. At one move per second that is 2⁶⁴ − 1 = 1.844674407371⋅10+19 moves (third link), about 585 billion years, more than forty times the age of the universe — and the eight-disk puzzle in front of you takes a minute and a half. The same doubling that makes the small case trivial makes the large case geological, which is the whole point of an exponential: 255 and 1.844674407371⋅10+19 are the same rule sixty differences apart.
Answer
255
How to read it
2⁸ − 1 on the workbench. The second link is three disks; the third is the sixty-four-disk count that ends the world.
Source
Édouard Lucas marketed the Tower of Hanoi in 1883 as the towers of Brahma at Benares; the minimum for n disks is 2ⁿ − 1, forced by the recurrence M(n) = 2M(n − 1) + 1
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.