The Dudeney-Stockmeyer conjecture

DOI10.1016/j.dam.2021.05.019zbMath1494.05037OpenAlexW3171124501WikidataQ113877234 ScholiaQ113877234MaRDI QIDQ2161227

Ciril Petr, Borut Lužar, Andreas M. Hinz

Publication date: 4 August 2022

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

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

zbMATH Keywords

integer sequencesgraph distancetower of HanoiFrame-Stewart conjecture

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Dynamic programming (90C39) Distance in graphs (05C12)

Cites Work

• The tower of Hanoi problem on Path\(_h\) graphs
• Stockmeyer's tower
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
• The fourth tower of Hanoi
• Open problems for Hanoi and Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• Exact Analysis of the Recurrence Relations Generalized from the Tower of Hanoi

This page was built for publication: The Dudeney-Stockmeyer conjecture