Counter examples to adjudicating a towers of hanoi contest

This paper points out the inconsistency in the criteria for adjudicating a Towers of Hanoi contest proposed by Wood. Counter examples to some of Wood's claims are given. In particular, the shortest path for transforming a configuration of n discs to another configuration may not be unique. Fina...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of computer mathematics Ročník 21; číslo 2; s. 123 - 131
Hlavný autor:	Er, M.C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Gordon and Breach Science Publishers 01.01.1987 Taylor and Francis
Predmet:	adjudication 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-wmputatlons on discrete structures representation state-space graph Theoretical computing Towers of Hanoi Algorithmics Problem solving Fast algorithm Permutation Combinatory problem
ISSN:	0020-7160, 1029-0265
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper points out the inconsistency in the criteria for adjudicating a Towers of Hanoi contest proposed by Wood. Counter examples to some of Wood's claims are given. In particular, the shortest path for transforming a configuration of n discs to another configuration may not be unique. Finally, a set of better criteria for adjudicating a Towers of Hanoi contest is proposed.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207168708803561