The tower of Hanoi problem on Path\(_h\) graphs

DOI10.1016/j.dam.2012.02.007zbMath1244.05013OpenAlexW1904087561MaRDI QIDQ427887

Shay Solomon, Daniel Berend, Amir Sapir

Publication date: 18 June 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.007

zbMATH Keywords

analysis of algorithmspath graphstower of Hanoisubexponential growth rate

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Dynamic programming (90C39)

Related Items

The Dudeney-Stockmeyer conjecture ⋮ A tour of general Hanoi graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

Cites Work

• Unnamed Item
• Unnamed Item
• Hanoi graphs and some classical numbers
• The diameter of Hanoi graphs
• On a question of Leiss regarding the Hanoi Tower problem
• The Little Towers of Antwerpen problem
• The cyclic towers of Hanoi
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The cyclic multi-peg Tower of Hanoi
• The Cyclic Towers of Hanoi: A Representation Approach
• The complexity of the generalised cyclic Towers of Hanoi problem
• 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
• On an infinite family of solvable Hanoi graphs
• Pascal's Triangle and the Tower of Hanoi
• On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
• Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
• Developments in Language Theory