Skip Navigation

The Computer Journal 1984 27(3):278-282; doi:10.1093/comjnl/27.3.278
© 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 (6)
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 Generalized Colour Towers of Hanoi: An Iterative Algorithm

M. C. Er *

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

An iterative algorithm for solving the generalized colour Towers of Hanoi problem is presented; and its underlying principles are discussed. The problem is a variant of the Towers of Hanoi problem; it has n black and white discs randomly stacked on three pegs as an initial configuration. The objective is to move all coloured discs to a specified peg subject to the usual constraints of the standard problem; in addition, white and black discs may only move clockwise and counterclockwise, respectively. A comparison with a recursive algorithm for solving the same problem is also made.

Received March 1983.

* Department of Computing Science, The 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.