Exponential vs. Subexponential Tower of Hanoi Variants

DOI10.7155/JGAA.00403MaRDI QIDQ2971384zbMATH OpenOpenAlexFDO

Authors Daniel Berend, Amir Sapir

Publication date 5 April 2017

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00403

zbMATH Keywords

Tower of Hanoi on digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• New variations on the tower of Hanoi
• New variants of the bottleneck tower of Hanoi problems
• Exact analysis of the recurrence relations generalized from the Tower of Hanoi
• scientific article; zbMATH DE number 1439478
• Towers of Hanoi and Analysis of Algorithms
• scientific article; zbMATH DE number 1185160
• A generalization of the cyclic towers of hanoi: an iterative solution
• The complexity of the generalised cyclic Towers of Hanoi problem

Cites work

• scientific article; zbMATH DE number 4008422 (Why is no real title available?)
• scientific article; zbMATH DE number 1439478 (Why is no real title available?)
• scientific article; zbMATH DE number 2187679 (Why is no real title available?)
• Developments in Language Theory
• Hanoi graphs and some classical numbers
• New variations on the tower of Hanoi
• On a question of Leiss regarding the Hanoi Tower problem
• On the Frame--Stewart Conjecture about the Towers of Hanoi
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• Optimality of an algorithm solving the bottleneck Tower of Hanoi problem
• Sur des points fixes de morphismes d'un monoïde libre
• The Cyclic Towers of Hanoi: A Representation Approach
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The Tower of Hanoi with Forbidden Moves
• The cyclic multi-peg Tower of Hanoi
• The cyclic towers of Hanoi
• The diameter of Hanoi graphs
• The super towers of Hanoi problem: Large rings on small rings
• The tower of Hanoi problem on Path\(_h\) graphs
• The towers of Antwerpen problem

Cited in

(3)

• A tour of general Hanoi graphs
• Which multi-peg Tower of Hanoi problems are exponential?
• Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time

This page was built for publication: Exponential vs. Subexponential Tower of Hanoi Variants

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