Abstract
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 produced iterative algorithm, both in terms of comprehensibility in its own right, and in efficiency.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
