Answers are grounded in this paper and cite their sources.
An ordered deck of n cards is subjected to k independent Gilbert--Shannon--Reeds riffle shuffles. A player then guesses each card without feedback, with repeated guesses allowed. For every fixed k≥1, we prove that, once n is sufficiently large, an optimal guess at position i in the top half of the deck is i/2ᵏ+1; the bottom-half strategy is obtained by reflection. We also show that the optimal expected number of correct guesses is 2√n/((2ᵏ-1)π)+Oₖ(1). Our starting point is the result of our earlier work that the label at each position is distributed as an equally weighted mixture of 2ᵏ components, each a shifted sum of two independent binomial random variables (a Poisson-binomial distribution). The proof of the optimal strategy combines three ingredients: a uniform concentration estimate that separates the mixture components, exact binomial inequalities that control the gaps between competing peaks, and a coefficient comparison that resolves modal ties. The expected-score asymptotic is proved independently of the strategy, using only the peak heights of the mixture components.
No takes yet. Share an insight, caveat, or question.
Krityakierne et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: