ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Assume Player I chooses a binary string A=a1…anA=a_1\dots a_n. 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 AA.

Flipped-game optimal-response conjecture. The best response strings for Player II are one or more of

HH…H,TT…T,a2…anH,a2…anT.HH\dots H,\quad TT\dots T,\quad a_2\dots a_nH,\quad a_2\dots a_nT.

The conjecture is motivated by computations through n=10n=10 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 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.