ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be the input to a two-player Bergman game, and consider the two analogous definitions of random Bergman games obtained by choosing moves randomly. Let the winner be either Player 1 or Player 2.

Fairness conjecture for random Bergman games. As N→∞N\to\infty, under both analogous definitions of random Bergman games, the probabilities that Player 1 and Player 2 win are each 1/21/2.

This conjecture asks whether the fairness phenomenon known for mindless play in Zeckendorf games extends to the two-player Bergman game under both random-game models. The source presents it as an open direction for further inquiry and gives no resolution.

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.