Fibonacci-like sequences for variants of the tower of Hanoi, and corresponding graphs and gray codes

06/07/2022
by   Benoît Rittaud, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/19/2020

Gray codes for Fibonacci q-decreasing words

An n-length binary word is q-decreasing, q≥ 1, if every of its length ma...
research
08/31/2022

Some properties of morphic images of (eventually) dendric words

The class of (eventually) dendric words generalizes well-known families ...
research
08/20/2021

Additive Polycyclic Codes over 𝔽_4 Induced by Binary Vectors and Some Optimal Codes

In this paper we study the structure and properties of additive right an...
research
05/05/2018

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

Recently, a class of binary sequences with optimal autocorrelation magni...
research
09/20/2022

Complement Avoidance in Binary Words

The complement x of a binary word x is obtained by changing each 0 in x ...
research
06/13/2018

Simple Laws about Nonprominent Properties of Binary Relations

We checked each binary relation on a 5-element set for a given set of pr...
research
11/11/2019

Information carefull worstcase DecreaseKey heaps with simple nonMeld variant

We analyze priority queues including DecreaseKey method in its interface...

Please sign up or login with your details

Forgot password? Click here to reset