ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnopt,randp_n^{\mathrm{opt,rand}} denote the probability that Player II wins in the Penney-Ante game when Player I plays optimally and Player II plays randomly.

Optimal–random asymptotic conjecture. As n→∞n\to\infty,

12−pnopt,rand∼14n2n.\frac{1}{2}-p_n^{\mathrm{opt,rand}}\sim \frac{1}{4}\frac{n}{2^n}.

The numerical data suggest that random play by Player II lowers the winning probability toward 1/21/2 with an asymptotic gap of order n2−nn2^{-n}. The source does not provide a resolution of this conjecture.

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.