Computational solution of an old tower of Hanoi problem

DOI10.1016/j.endm.2016.05.038zbMath1347.05049OpenAlexW2513243193MaRDI QIDQ327694

Andreas M. Hinz, Ciril Petr

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.038

zbMATH Keywords

integer sequencesbreadth-first searchgraph distancetower of Hanoi

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (2)

Open problems for Hanoi and Sierpiński graphs ⋮ Stockmeyer's tower

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The fourth tower of Hanoi
• The Tower of Hanoi – Myths and Maths
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

This page was built for publication: Computational solution of an old tower of Hanoi problem