ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A Zeckendorf game starts from the Zeckendorf decomposition of nn 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 nn, 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 nn, with the constant appearing numerically to be approximately 1.2061.206.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.