Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Birtwistle (1985)
The coroutines of HanoiACM SIGPLAN Notices, 20
Herbert Mayer, D. Perkins (1984)
Towers of Hanoi revisited a nonrecursive surpriseACM SIGPLAN Notices, 19
(1984)
Letter to the Editor , SIGPLAN NOTICES
P. Hayes (1977)
Discussion and correspondence A note on the Towers of Hanoi problemThe Computer Journal, 20
Manfred Stadel (1984)
Another nonrecursive algorithm for the towers of HanoiACM SIGPLAN Notices, 19
W. Franklin (1984)
A simpler iterative solution to the Towers of Hanoi problemACM SIGPLAN Notices, 19
P. Buneman, L. Levy (1980)
The Towers of Hanoi ProblemInf. Process. Lett., 10
B. Meyer (1984)
A note on iterative HanoiACM SIGPLAN Notices, 19
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.
ACM SIGPLAN Notices – Association for Computing Machinery
Published: Sep 1, 1985
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.