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.

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 14; no. 3-4; pp. 199 - 207
Main Author:	Wood, D.
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.1983 Taylor and Francis
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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