ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be the initial number of copies of F1F_1 in the Ordered Zeckendorf game, and let the Long Game Strategy (LGS) be the priority-based strategy that performs switch moves, combines adjacent ones from the left, performs split moves from the right, and performs merge moves from the left. Long Game Strategy conjecture. The LGS has the longest game length. This conjecture would establish that the proposed strategy attains the maximal length M(n)M(n) of the game, complementing the known upper bound on M(n)M(n). Its status is unresolved in the supplied text.

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.