Exponential vs. Subexponential Tower of Hanoi Variants

DOI10.7155/jgaa.00403zbMath1358.05188OpenAlexW2538607981MaRDI QIDQ2971384

Amir Sapir, Daniel Berend

Publication date: 5 April 2017

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

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

zbMATH Keywords

Tower of Hanoi on digraphs

Mathematics Subject Classification ID

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

Related Items

A tour of general Hanoi graphs

Cites Work

• The tower of Hanoi problem on Path\(_h\) graphs
• The super towers of Hanoi problem: Large rings on small rings
• Hanoi graphs and some classical numbers
• The diameter of Hanoi graphs
• On a question of Leiss regarding the Hanoi Tower problem
• The cyclic towers of Hanoi
• The towers of Antwerpen problem
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The Tower of Hanoi – Myths and Maths
• The cyclic multi-peg Tower of Hanoi
• Sur des points fixes de morphismes d'un monoïde libre
• The Cyclic Towers of Hanoi: A Representation Approach
• On the Frame--Stewart Conjecture about the Towers of Hanoi
• The Tower of Hanoi with Forbidden Moves
• Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
• Developments in Language Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item