On the Frame--Stewart Conjecture about the Towers of Hanoi

DOI10.1137/S0097539703431019zbMath1055.05002OpenAlexW2091425587WikidataQ123367462 ScholiaQ123367462MaRDI QIDQ4651482

Xiao Chen, Jian Shen

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539703431019

zbMATH Keywords

optimal algorithmFrame-Stewart algorithmFrame-Stewart conjectureTowers of Hanoi problem

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics in computer science (68R05) Asymptotic enumeration (05A16)

Related Items (10)

Santa Claus' Towers of Hanoi ⋮ A new lower bound for the Towers of Hanoi problem ⋮ Bounded Hanoi ⋮ 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. ⋮ Stockmeyer's tower ⋮ On generalized Frame-Stewart numbers ⋮ Hanoi graphs and some classical numbers

This page was built for publication: On the Frame--Stewart Conjecture about the Towers of Hanoi