TITLE: Generalization of the Tower of Hanoi?
QUESTION [6 upvotes]: What is the least possible number of steps for the Tower of Hanoi with $n$ discs and an arbitrary number $k$ of towers?
For example, Tower of Hanoi with $4$ towers, $5$ towers, etc.

REPLY [3 votes]: The article by Demontis is totally flawed, for more details see https://doi.org/10.1142/S1793830919500496. In 2014 Thierry Bousch published a solution to The Reve's puzzle (four pegs version), see https://www.math.u-psud.fr/~bousch/preprints/revespzl.pdf. The FS conjecture for Tower of Hanoi with five or more pegs remains an open problem.