Skip Navigation

The Computer Journal 2004 47(1):20-24; doi:10.1093/comjnl/47.1.20
© 2004 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 (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sapir, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Tower of Hanoi with Forbidden Moves

Amir Sapir

Department of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel

We consider a variant of the classical three-peg Tower of Hanoi problem, where limitations on the possible moves among the pegs are imposed. Each variant corresponds to a di-graph whose vertices are the pegs, and an edge from one vertex to another designates the ability of moving a disk from the first peg to the other, provided that the rules concerning the disk sizes are obeyed. There are five non-isomorphic graphs on three vertices, which are strongly connected—a sufficient condition for the existence of a solution to the problem. We provide optimal algorithms for the problem for all these graphs, and find the number of moves each requires.

Received 9 August 2002. Revised 2 April 2003.

* Email: amirsa{at}cs.bgu.ac.il


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.