The multiway trees of hanoi

We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality. Finally we solve the simultaneous recurrence equations to give an exact formula for the minimal number of moves necessary.

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of computer mathematics Ročník 14; číslo 2; s. 137 - 153
Hlavní autoři:	Jürgensen, Helmut, Wood, Derick
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Gordon and Breach Science Publishers 01.01.1983 Taylor and Francis
Témata:	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-omputations on discrete structures G.2.1 [Discrete Mathematics]: Combinatorics-recurrences and difference equations multiway trees optimality simultaneous recurrence equations Theoretical computing Towers of Hanoi trees of Hanoi 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í:	We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality. Finally we solve the simultaneous recurrence equations to give an exact formula for the minimal number of moves necessary.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207168308803380