Which multi-peg Tower of Hanoi problems are exponential?

DOI10.1007/978-3-642-34611-8_11MaRDI QIDQ5200496zbMATH OpenOpenAlexFDO

Authors Daniel Berend, Amir Sapir

Publication date 6 November 2012

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34611-8_11

zbMATH Keywords

connectivitydirected graphsshedsub-exponential complexityTower of Hanoi

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Exponential vs. Subexponential Tower of Hanoi Variants
• The tower of Hanoi problem on Path\(_h\) graphs
• On a question of Leiss regarding the Hanoi Tower problem
• The Tower of Hanoi with Forbidden Moves
• The cyclic multi-peg Tower of Hanoi

Cited in

(3)

• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• How to do a half-turn in the cyclic tower of Hanoi
• Algorithmic calculation of the optimality probability of decision rules

This page was built for publication: Which multi-peg Tower of Hanoi problems are exponential?

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