Move all the disks on the leftmost tower to the rightmost tower.
You may move only one disk at a time.
A bigger disk may not be put on top of a smaller disk.
[Click on ne of the orange arrows above to move the topmost disk.]

The Tower of Hanoi problem was invented by French mathematician Edouard Lucas in 1883. Assuming that moving 1 disk takes 1 second, it has been estimated that 500 billion years will be required to finish a 64 disk problem.