Linear-growth conjecture for Split Smallest and Combine Smallest games
Statement
A Zeckendorf game starts from the Zeckendorf decomposition of and proceeds by legal combining and splitting moves; the Split Smallest and Combine Smallest games are deterministic strategies, and the number of moves is measured as the total number of moves in the resulting game.
Linear-growth conjecture. For Split Smallest, the number of moves grows linearly with , with the asymptotic constant appearing numerically to be the square of the golden mean. For Combine Smallest games, the number of moves grows linearly with , with the constant appearing numerically to be approximately .
The paper presents these claims as data-supported conjectures for the two deterministic games whose behavior was not rigorously determined there.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.