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....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 237; číslo 1; s. 407 - 421
Hlavní autor:	Sarkar, U.K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 28.04.2000 Elsevier
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!