An optimal algorithm to implement the Hanoi towers with parallel moves

DOI10.1016/S0020-0190(03)00226-6MaRDI QIDQ1007629zbMATH OpenFDO

Authors Jer-Shyan Wu, Yu-Kuo Wang

Publication date 23 March 2009

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmstowers of Hanoi

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• A note on parallelism for the towers of Hanoi
• The worst parallel Hanoi graphs
• An iterative optimal algorithm for the generalized tower of hanoi problem
• The complexity of an optimal algorithm for the generalized tower of hanoi problem
• scientific article; zbMATH DE number 1087226

Cites work

• scientific article; zbMATH DE number 3705883 (Why is no real title available?)
• Discussion and correspondence: A note on the Towers of Hanoi problem
• Iteration strikes back - at the cyclic Towers of Hanoi
• The Towers of Hanoi Problem
• The Towers of Hanoi rainbow problem: Coloring the rings
• The cyclic towers of Hanoi
• The towers of Hanoi problem with cyclic parallel moves
• The towers of Hanoi problem with parallel moves
• The towers of Hanoi revisited: Moving the rings by counting the moves

Cited in

(5)

• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time
• A note on parallelism for the towers of Hanoi
• Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
• Efficient parallel strategies for Hanoi games

This page was built for publication: An optimal algorithm to implement the Hanoi towers with parallel moves

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