Optimal strategy score error-term conjecture for card guessing with Yes/No feedback
Statement
Let and denote the card multiplicity and number of card types, respectively, and let be the score under an optimal strategy with Yes/No feedback. Optimal score error-term conjecture. For all , if is sufficiently large in terms of , then
where this bound holds uniformly in . This conjecture aims to close the gap between the known error terms for the optimal strategy; its resolution is not supplied in the source.
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.