2012/04/19 by Mikael Erik Jörgensen, Jörgensen, Mikael Erik
Computer Science · Engineering · Mathematics · #90C27 (Combinatorial optimization) #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Structural Analysis and Optimization #cs.DM #math.CO #msc:90C27
paper · pdf · doi:10.48550/arxiv.1204.4411
9 pages
openalex publication_date 2012/04/19 · arxiv created 2012/04/21 · arxiv updated 2012/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The purpose of this paper is to prove the Frame-Stewart algorithm for the generalized Towers of Hanoi problem as well as finding the number of moves required to solve the problem and studying the multitude of optimal solutions. The main idea is to study how to most effectively move away all but the last disc and use the fact that the total number of moves required to solve the problem is twice this number plus one.