ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A Zeckendorf game on nn consists of legal combining and splitting moves applied to the Zeckendorf decomposition of nn. 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 nn is achieved by applying splitting moves whenever possible: first adding 11'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 11'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 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.