On the Frame-Stewart Conjecture

2020/07/16 by Youngjin Bae, Bae, Youngjin
Arts and Humanities · Computer Science · Social Sciences · #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Historical Studies and Socio-cultural Analysis #Vietnamese History and Culture Studies

paper · pdf · doi:10.48550/arxiv.2007.08131

openalex publication_date 2020/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Frame-Stewart conjecture states the least number of moves to solve a generalized Tower of Hanoi problem, of n disks and p pegs. In this paper, we prove a weaker version of the Frame-Stewart conjecture.

Related

• What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?
• Self Similarities of the Tower of Hanoi Graphs and a proof of the Frame-Stewart Conjecture
• Solutions to the generalized Towers of Hanoi problem
• On the Footsteps to Generalized Tower of Hanoi Strategy
• Generalizations of the Hanoi Towers Problem