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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of computer mathematics Ročník 14; číslo 3-4; s. 199 - 207
Hlavní autor:	Wood, D.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Gordon and Breach Science Publishers 01.01.1983 Taylor and Francis
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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