Computational Solution of an Old Tower of Hanoi Problem

• Published in: Electronic notes in discrete mathematics Vol. 53; pp. 445 - 458
• Main Authors: Hinz, Andreas M., Petr, Ciril
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.09.2016
• Subjects: breadth-first search; graph distance; integer sequences; Tower of Hanoi; breadth-first search; integer sequences; Tower of Hanoi; graph distance
• ISSN: 1571-0653; 1571-0653
• DOI: 10.1016/j.endm.2016.05.038

This is the amazing story of an innocent looking mathematical puzzle turning into a serious research topic in graph theory, integer sequences, and algorithms. The Tower of Hanoi and The Reve's Puzzle of Lucas and Dudeney, respectively, induced a wealth of interesting mathematical and algorithmic challenges over more than a century. Although some part of the most intriguing question, the Frame-Stewart Conjecture, has recently been solved, several of the original tasks posed by Dudeney remained intractable. We present the history and theory of these questions and a computational approach which allowed us to solve a 104 years old problem of Dudeney, namely the proof of minimality of an algorithm producing paths between perfect states of the Tower of Hanoi with 5 pegs and 20 discs. Many questions about the metric properties of Hanoi graphs remain open, however, and have to be treated by analytical and computational methods in the future.