On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem

DOI10.1016/S0166-218X(01)00287-6zbMath1019.90047OpenAlexW1965106165MaRDI QIDQ1613371

Uroš Milutinović, Ciril Petr, Sandi Klavžar

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00287-6

zbMATH Keywords

dynamic programmingrecursionFrame-Stewart algorithmmulti-peg tower of Hanoi problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Related Items

Santa Claus' Towers of Hanoi, The diameter of Hanoi graphs, Computational solution of an old tower of Hanoi problem, Sierpiński graphs as spanning subgraphs of Hanoi graphs, The tower of Hanoi problem on Path\(_h\) graphs, Exponential vs. Subexponential Tower of Hanoi Variants, Growth of Schreier graphs of automaton groups., What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?, The number of moves of the largest disc in shortest paths on Hanoi graphs, Asymptotic aspects of Schreier graphs and Hanoi Towers groups., On generalized Frame-Stewart numbers, Hanoi graphs and some classical numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterative algorithm for the Tower of Hanoi with four pegs
• Shortest paths between regular states of the Tower of Hanoi
• The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
• The generalized_ppeg tower of hanoi problem