Computational solution of an old tower of Hanoi problem

DOI10.1016/J.ENDM.2016.05.038MaRDI QIDQ327694zbMATH OpenOpenAlexFDO

Authors 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

breadth-first searchgraph distanceinteger sequencestower of Hanoi

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• An Algorithmic Solution to the Multi-tower Hanoi Problem
• scientific article; zbMATH DE number 1439478
• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
• An iterative algorithm for the cyclic Towers of Hanoi problem
• Towers of Hanoi problems: deriving iterative solutions by program transformations
• Towers of Hanoi and Analysis of Algorithms
• The Generalized Towers of Hanoi Problem
• scientific article; zbMATH DE number 4008422

Cites work

• scientific article; zbMATH DE number 3450117 (Why is no real title available?)
• scientific article; zbMATH DE number 1439478 (Why is no real title available?)
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The fourth tower of Hanoi
• The number of moves of the largest disc in shortest paths on Hanoi graphs

Cited in

(4)

• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• Open problems for Hanoi and Sierpiński graphs
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• Stockmeyer's tower

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327694)