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

DOI10.1016/0895-7177(96)00098-2zbMath0868.68087OpenAlexW2052966781MaRDI QIDQ1816622

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)

Cites Work

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

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