Add to ORKGWe 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
19 pages, 5 figures, 3 tablesInternational audienceAn $n$-length binary word is $q$-decreasing, $q\g...
Le cube de Fibonacci est un sous-graphe isométrique de l'hyper- cube ayant un nombre de Fibonacci de...
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained...
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonac...
By making the moving direction of each disc explicit in the representation, a bit-string so construc...
We give new algorithms for generating all n-tuples over an alphabet of m letters, changing only one ...
AbstractThe multi-peg Towers of Hanoi problem is still open. No provably optimal constructive algori...
The Tower of Hanoi puzzle was created over a century ago by the number theorist Edouard Lucas [2, 4]...
Morse code sequences are very useful to give combinatorial interpretations of various properties of...
Morse code sequences are very useful to give combinatorial interpretations of various properties of ...
There exists an infinite family of puzzles, the SF Puzzle, that correspond to labelings on iterated ...
Abstract. We look at a family of meta-Fibonacci sequences which arise in studying the number of leav...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
Morse code sequences are very useful to give combinatorial interpretations of various properties of ...
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
19 pages, 5 figures, 3 tablesInternational audienceAn $n$-length binary word is $q$-decreasing, $q\g...
Le cube de Fibonacci est un sous-graphe isométrique de l'hyper- cube ayant un nombre de Fibonacci de...
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained...
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonac...
By making the moving direction of each disc explicit in the representation, a bit-string so construc...
We give new algorithms for generating all n-tuples over an alphabet of m letters, changing only one ...
AbstractThe multi-peg Towers of Hanoi problem is still open. No provably optimal constructive algori...
The Tower of Hanoi puzzle was created over a century ago by the number theorist Edouard Lucas [2, 4]...
Morse code sequences are very useful to give combinatorial interpretations of various properties of...
Morse code sequences are very useful to give combinatorial interpretations of various properties of ...
There exists an infinite family of puzzles, the SF Puzzle, that correspond to labelings on iterated ...
Abstract. We look at a family of meta-Fibonacci sequences which arise in studying the number of leav...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
Morse code sequences are very useful to give combinatorial interpretations of various properties of ...
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
19 pages, 5 figures, 3 tablesInternational audienceAn $n$-length binary word is $q$-decreasing, $q\g...
Le cube de Fibonacci est un sous-graphe isométrique de l'hyper- cube ayant un nombre de Fibonacci de...
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained...