The Towers of Fibonacci, Lucas, Pell, and Jacobsthal
El-Mehdi Mehiri, Saad Mneimneh, Hac\`ene Belbachir
TL;DR
This paper introduces four new Tower of Hanoi variants linked to Fibonacci, Lucas, Pell, and Jacobsthal numbers, providing optimal solutions and their associated graphs.
Contribution
It presents novel Tower of Hanoi variants connected to four famous number sequences, with optimal solutions and graph representations.
Findings
Optimal solutions for each variant are derived.
Associated graphs for each variant are constructed.
Variants are related to Fibonacci, Lucas, Pell, and Jacobsthal numbers.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.