An optimal algorithm to implement the Hanoi towers with parallel moves

DOI10.1016/S0020-0190(03)00226-6zbMath1156.68503MaRDI QIDQ1007629

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)

Cites Work

• Unnamed Item
• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• The towers of Hanoi revisited: Moving the rings by counting the moves
• The towers of Hanoi problem with parallel moves
• The towers of Hanoi problem with cyclic parallel moves
• Iteration strikes back - at the cyclic Towers of Hanoi
• The Towers of Hanoi rainbow problem: Coloring the rings
• Discussion and correspondence: A note on the Towers of Hanoi problem