2022/06/07 by Benoît Rittaud, Rittaud, Benoît
Computer Science · Engineering · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Number Theory (math.NT) #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2206.03047
openalex publication_date 2022/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonacci sequence involved in the optimal algorithm of resolution, and show some nice properties of such a variant. In particular, we deduce from this Tower of Hanoi-Fibonacci a Gray-like code on the set of binary words without the factor 11, which has some properties intersting for itself and from which an iterative algorithm for the Tower of Hanoi-Fibonacci is obtained. Such an algorithm involves the Fibonacci substitution. Eventually, we briefly extend the study to some natural generalizations.