The cyclic multi-peg Tower of Hanoi

DOI10.1145/1159892.1159893MaRDI QIDQ2944518zbMATH OpenOpenAlexFDO

Authors Daniel Berend, Amir Sapir

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1159892.1159893

zbMATH Keywords

multi-peg Tower of Hanoi

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• The Tower of Hanoi with Forbidden Moves
• The diameter of Hanoi graphs
• The tower of Hanoi problem on Path\(_h\) graphs
• Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

Cited in

(16)

• Note on the cyclic towers of Hanoi
• The worst parallel Hanoi graphs
• Exponential vs. Subexponential Tower of Hanoi Variants
• The tower of Hanoi problem on Path\(_h\) graphs
• scientific article; zbMATH DE number 1488860 (Why is no real title available?)
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
• The Tower of Hanoi with Forbidden Moves
• New variants of the bottleneck tower of Hanoi problems
• Bounded Hanoi
• Which multi-peg Tower of Hanoi problems are exponential?
• Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
• scientific article; zbMATH DE number 2187679 (Why is no real title available?)
• How to do a half-turn in the cyclic tower of Hanoi
• On the restricted Hanoi graphs
• Note on the Towers of Hanoi problem.
• The diameter of Hanoi graphs

This page was built for publication: The cyclic multi-peg Tower of Hanoi

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