The Towers of Fibonacci, Lucas, Pell, and Jacobsthal
arXiv:2502.11045h-index: 15
AI Analysis
This is an incremental contribution for puzzle enthusiasts and mathematicians interested in combinatorial problems.
The paper introduces four new variants of the Tower of Hanoi problem whose optimal solutions are related to Fibonacci, Lucas, Pell, and Jacobsthal numbers. Optimal solutions and associated graphs are provided.
We present in this paper four new variants of the Tower of Hanoi problem, the optimal solution of each of these variants is related to one of the four known numbers Fibonacci, Lucas, Pell, and Jacobsthal. We give an optimal solution to each of these variants, and we present their associated graphs.