Skip Navigation

The Computer Journal 1987 30(4):376-378; doi:10.1093/comjnl/30.4.376
© 1987 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gault, D.
Right arrow Articles by Clint, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Notes

A Fast Algorithm for the Towers of Hanoi Problem

D. Gault * and M. Clint *

Department of Computer Science, The Queen's University of Belfast, Belfast BT7 1NN, Northern Ireland, UK

An O(n) time complexity algorithm for the Towers and Hanoi problem together with a proof of its correctness is given.

Received September 1986.

* Department of Computer Science, The Queen's University of Belfast, Belfast BT7 1NN, Northern Ireland


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.