Asymptotic conjecture for optimal Player I and random Player II in Penney-Ante
Statement
Let 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 ,
The numerical data suggest that random play by Player II lowers the winning probability toward with an asymptotic gap of order . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.