The complexity of an optimal algorithm for the generalized tower of hanoi problem

The Generalized Tower of Hanoi Problem is the transformation of an arbitrary initial configuration of n discs distributed among three pegs to an arbitrary final configuration, subject to the well-known Tower of Hanoi rules.The total number of disc moves in an optimal algorithm for this problem is co...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 36; no. 1-2; pp. 1 - 8
Main Author Van Zanten, A. J.
Format Journal Article
LanguageEnglish
Published Abingdon Gordon and Breach Science Publishers S.A 01.01.1990
Taylor and Francis
Subjects
Applied sciences
Artificial intelligence
complexity
Computer science; control theory; systems
Exact sciences and technology
optimal algorithm
Problem solving, game playing
Tower of Hanoi problem
Generalization
Optimal algorithm
Algorithm complexity
Online AccessGet full text
ISSN0020-7160
1029-0265
DOI10.1080/00207169008803905

Cover

More Information
Summary:The Generalized Tower of Hanoi Problem is the transformation of an arbitrary initial configuration of n discs distributed among three pegs to an arbitrary final configuration, subject to the well-known Tower of Hanoi rules.The total number of disc moves in an optimal algorithm for this problem is computed, and expressed in terms of two binary numbers. A simple criterion is derived, to decide whether in an optimal algorithm the largest disc is moved once or twice
ISSN:0020-7160
1029-0265
DOI:10.1080/00207169008803905