Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach

DOI10.1016/0895-7177(96)00098-2MaRDI QIDQ1816622zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 17 August 1997

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(96)00098-2

zbMATH Keywords

parallel multipeg Towers of Hanoi problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An optimal algorithm to implement the Hanoi towers with parallel moves
• A note on parallelism for the towers of Hanoi
• On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem
• The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
• A recursive algorithm for the multi-peg tower of hanoi problem
• An Algorithmic Solution to the Multi-tower Hanoi Problem
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• Efficient parallel strategies for Hanoi games
• Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem

Cites work

• A Representation Approach to the Tower of Hanoi Problem
• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
• A loopless approach to the multipeg towers of hanoi
• A note on parallelism for the towers of Hanoi
• An iterative algorithm for the Tower of Hanoi with four pegs
• Parallelism for multipeg towers of Hanoi
• The towers of Hanoi problem with parallel moves
• The towers of Hanoi revisited: Moving the rings by counting the moves

Cited in

(1)

• A note on parallelism for the towers of Hanoi

This page was built for publication: Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816622)