Longest-game conjecture for the Split Smallest strategy
Statement
A Zeckendorf game on consists of legal combining and splitting moves applied to the Zeckendorf decomposition of . The Split Smallest deterministic game applies moves by splitting from smallest to largest, after which it adds consecutive indices from smallest to largest.
Longest-game conjecture. The longest game on any is achieved by applying splitting moves whenever possible: first adding 's, then splitting from smallest to largest, and finally adding consecutive indices from smallest to largest. The source also identifies Split Smallest, which instead splits from smallest to largest before adding 's and then adding consecutive indices from smallest to largest, as another candidate for a longest possible game.
The statement is presented as an earlier conjecture, while the paper describes Split Smallest as another candidate and does not report a resolution of either claim.
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.