Long Game Strategy conjecture for the Ordered Zeckendorf Game
Statement
Let be the initial number of copies of 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 of the game, complementing the known upper bound on . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.