The number of moves of the largest disc in shortest paths on Hanoi graphs

zbMath1305.05059MaRDI QIDQ490248

Ciril Petr, Simon Aumann, Andreas M. Hinz, Katharina A. M. Götz

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p38

zbMATH Keywords

symmetriesshortest pathsbreadth-first searchHanoi graphsTower of Hanoi

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (5)

A new lower bound for the Towers of Hanoi problem ⋮ Computational solution of an old tower of Hanoi problem ⋮ Open problems for Hanoi and Sierpiński graphs ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Coloring Hanoi and Sierpiński graphs
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The tower of Hanoi
• The average eccentricity of Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• The Group of Symmetries of the Tower of Hanoi Graph
• Adjudicating a towers of hanoi contest†
• Towers of hanoi graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: The number of moves of the largest disc in shortest paths on Hanoi graphs