On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem

The multi-peg Towers of Hanoi problem is still open. No provably optimal constructive algorithm to solve the problem is known. The minimum number of moves required is also unknown. This paper analyses the properties of an optimal algorithm and presents a deterministic algorithm to solve the problem....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 237; H. 1; S. 407 - 421
1. Verfasser:	Sarkar, U.K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 28.04.2000 Elsevier
Schlagworte:	Applied sciences Combinatorial explosion Combinatorial problem Design of algorithm Dynamic programming Exact sciences and technology Game theory Operational research and scientific management Operational research. Management science Recursive formulation Towers of Hanoi Combinatorial explosion Recursive formulation Dynamic programming Towers of Hanoi Design of algorithm Combinatorial problem Multiple peg towers of Hanoi problem Optimal solution Hanoi tower Game theory Complexity
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!