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.

Bibliographic Details

Published in:	International journal of computer mathematics Vol. 14; no. 2; pp. 137 - 153
Main Authors:	Jürgensen, Helmut, Wood, Derick
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.1983 Taylor and Francis
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!