The puzzle consists in moving all the disks from the source peg to the destination one. Only one disk can be moved in each movement, and a bigger disk can’t ever moved on a smaller one.
The minimum number of movements needed for
2n-1, the, with 64 disks and moving one disk each second, the puzzle solution would last 585.442 billions years (calculus fromWikipedia).
This would be the actual position of the disks if the execution would have started on 1883, when the puzzle was ivented by Édouard Lucas.