The strict first-player disadvantage conjecture for random Chomp
Statement
A Chomp board is a finite left-justified configuration of cells, and random play means that each legal move is chosen uniformly at random. Consider a starting configuration with more than one row and more than one column. Strict first-player disadvantage conjecture. The player going first will win with probability strictly less than . This has been verified for every configuration calculated in the paper, but a proof would require understanding how quickly the winning probabilities approach .
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.