Object: Move all the disks to the center post.

You cannot move a larger disk on top of a smaller one.

A 'Towers of Hanoi' game with only seven disks (or less) is included in the Zillions disk. However, the code used there cannot easily be generalized to a large number of disks, since it does not have an elegant way to compare the sizes of disks.
The game 'Towers' presented here uses a binary size code, which allows an unlimited number of disks to be compared with each other.

Solving algorithm implemented!
The Zillions game 'Towers of Hanoi' game does not give a solving algorithm.
Variant 2 of 'Towers of Hanoi (KS)' has a solving algorithm implemented which works for any number of disks and always finds the shortest way to the solution (see strategy text for details).
So choose variant 2, let the computer do the work (select Play/ChooseSide and unselect Player) and observe!

This 'Towers Of Hanoi' puzzle was invented by the French mathematician Edouard Lucas in 1883.
It was sold (in an eight-disk version) as a toy, with an account of a legend that there is a "Tower of Brahma" in a temple in Benares, India.
This tower has 64 golden disks, which the temple priests move at one disk each second.
When they complete their task, the world will come to an end in a clap of thunder.
This should take a little over 18 billion billion seconds.