Skip Navigation

The Computer Journal 1989 32(2):187-189; doi:10.1093/comjnl/32.2.187
© 1989 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 Lu, X.-M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

An Iterative Solution for the 4-peg Towers of Hanoi

X.-M. Lu *

Department of Mathematics, Yunnan Teachers University, Kunming, China

In the literature a few recursive algorithms have been proposed for the multipeg Towers of Hanoi problem. This paper puts forward a non-recursive algorithm for the 4-peg Towers of Hanoi problem, a restricted case of the multipeg Towers.

Received January 1988. revised July 1988.

* Department of Mathematics, Yunnan Teachers University, Kunming, the People's Republic of China


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.