NONRECURSIVE SOLUTION TO PARALLEL MULTIPEG TOWERS OF HANOI - A DECOMPOSITION APPROACH

Authors
LU XM DILLON TS
Citation
Xm. Lu et Ts. Dillon, NONRECURSIVE SOLUTION TO PARALLEL MULTIPEG TOWERS OF HANOI - A DECOMPOSITION APPROACH, Mathematical and computer modelling, 24(3), 1996, pp. 29-35
Citations number
14
Categorie Soggetti
Mathematics,Mathematics,"Computer Science Interdisciplinary Applications","Computer Science Software Graphycs Programming
Journal title
Mathematical and computer modelling → ACNP
ISSN journal
08957177
Volume
24
Issue
3
Year of publication
1996
Pages
29 - 35
Database
ISI
SICI code
0895-7177(1996)24:3<29:NSTPMT>2.0.ZU;2-Q
Abstract
By decomposing the recursive solution established in [1] into what we call sectors, a nonrecursive solution is obtained for the parallel mul tipeg Towers of Hanoi problem. The decomposition discloses more inhere nt properties of the existing recursive solution. In addition, the con trolling 0-1 matrix introduced in [2] is used for the determination of usage of pegs.