What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?

2012/03/15 by Roberto Demontis, Demontis, Roberto
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Limits and Structures in Graph Theory #Optimization and Packing Problems #cs.DM

paper · pdf · doi:10.48550/arxiv.1203.3280

openalex publication_date 2012/03/15 · arxiv created 2016/09/23 · arxiv updated 2016/09/26 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28

Abstract

We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.

Related

• A new lower bound for the Towers of Hanoi problem
• Solutions to the generalized Towers of Hanoi problem
• On the Frame-Stewart Conjecture
• Generalizations of the Hanoi Towers Problem
• On the Footsteps to Generalized Tower of Hanoi Strategy