Conjecture on optimal responses in the flipped Penney-Ante game
Statement
Assume Player I chooses a binary string . In the flipped Penney-Ante game, the player whose string appears last wins. A response string for Player II is optimal if it maximizes Player II's winning probability against .
Flipped-game optimal-response conjecture. The best response strings for Player II are one or more of
The conjecture is motivated by computations through and by the displayed examples, where optimal responses follow this four-form pattern. The source does not provide a resolution, and it remains open.
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.