An iterative solution to the Cyclic Towers of Hanoi puzzle is produced
by largely automatic program transformation from a recursive solution
. The result compares favourably with the best published, manually pro
duced iterative algorithm, both in terms of comprehensibility in its o
wn right, and in efficiency.