The towers of Hanoi
Bleicke Eggers · ACM SIGPLAN Notices · 1985
Another nonrecursive algorithm for The towers of Hanoi Problem is presented. It serves to compute the disk configuration from a given move number and the disk to be moved together with its current peg and target. The procedure gives rise to detect faults in erroneous computations.