Skip Navigation

The Computer Journal 1984 27(2):171-175; doi:10.1093/comjnl/27.2.171
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Er, M. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Cyclic Towers of Hanoi: A Representation Approach

M. C. Er *

Department of Computing Science, University of Wollongong, P.O. Box 1144, Wollongong, Australia

In the cyclic Towers of Hanoi problem, all discs are required to move in a clockwise direction only, subject to the usual restrictions of the standard problem. Atkinson, who proposed the modified problem, presented a recursive solution but found it not so easy to solve by iteration. This paper presents an iterative solution to the modified problem using a representation approach. Further, several interesting and intrinsic properties of the cyclic problem are also discussed.

Received November 1982.

* Department of Computing Science, University of Wollongong, P.O. Box 1144, Wollongong 2500, N.S.W., Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.