Adjudicating a towers of hanoi contest

The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated. We present linear time and space adjudication algorithms, that is optimal adjudication algorithms.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer mathematics Jg. 14; H. 3-4; S. 199 - 207
1. Verfasser: Wood, D.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Gordon and Breach Science Publishers 01.01.1983
Taylor and Francis
Schlagworte:
Adjudication algorithm
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
F.2.2. [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-computations on discrete structures
Optimal algorithm
Theoretical computing
Towers of hanoi
Adjudication
Optimal algorithm
Algorithm analysis
ISSN:0020-7160, 1029-0265
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated. We present linear time and space adjudication algorithms, that is optimal adjudication algorithms.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207168308803386