Optimal strategy upper-bound 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 upper-bound conjecture. For all and , if is sufficiently large in terms of , then
This is motivated by the known asymptotic behavior of the ratio and by existing bounds, but the asserted upper bound 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.