The cyclic multi-peg Tower of Hanoi

DOI10.1145/1159892.1159893zbMath1321.68447OpenAlexW2051684267MaRDI QIDQ2944518

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

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

Related Items (5)

The diameter of Hanoi graphs ⋮ The worst parallel Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

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