We consider the following problem. A deck of $2n$ cards labeled consecutively from 1 on top to $2n$ on bottom is face down on the table. The deck is given k dovetail shuffles and placed back on the table, face down. A guesser tries to guess at the cards one at a time, starting from top. The identity of the card guessed at is not revealed, nor is the guesser told whether a particular guess was correct or not. The goal is to maximize the number of correct guesses. We show that, for $k \geq 2 \log_2 (2n) + 1$, the best strategy is to guess card 1 for the first half of the deck and card $2n$ for the second half. This result can be interpreted as indicating that it suffices to perform the order of $\log_2(2n)$ shuffles to obtain a well-mixed deck, a fact proved by Bayer and Diaconis. We also show that if $k = c \log_2 (2n)$ with $1 < c < 2$, then the above guessing strategy is not the best.
Ann. Appl. Probab.
8(4):
1251-1269
(November 1998).
DOI: 10.1214/aoap/1028903379
1 ALDOUS, D. 1983. Random walks on finite groups and rapidly mixing Markov chains. Seminaire de Probabilites XVII. Lecture Notes in Math. 986 243 297. Springer, New ´ ´ York. MR86j:60156 0514.600671 ALDOUS, D. 1983. Random walks on finite groups and rapidly mixing Markov chains. Seminaire de Probabilites XVII. Lecture Notes in Math. 986 243 297. Springer, New ´ ´ York. MR86j:60156 0514.60067
2 ALDOUS, D. and DIACONIS, P. 1986. Shuffling cards and stopping times. Amer. Math. Monthly 93 333 348. MR88a:60021 10.2307/23235902 ALDOUS, D. and DIACONIS, P. 1986. Shuffling cards and stopping times. Amer. Math. Monthly 93 333 348. MR88a:60021 10.2307/2323590
3 BAy ER, D. and DIACONIS, P. 1992. Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294 313. MR93d:60014 0757.60003 10.1214/aoap/1177005705 euclid.aoap/1177005705
3 BAy ER, D. and DIACONIS, P. 1992. Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294 313. MR93d:60014 0757.60003 10.1214/aoap/1177005705 euclid.aoap/1177005705
4 DIACONIS, P. 1988. Group Representations in Probability and Statistics. IMS, Hay ward, CA. MR90a:60001 0695.600124 DIACONIS, P. 1988. Group Representations in Probability and Statistics. IMS, Hay ward, CA. MR90a:60001 0695.60012
5 DIACONIS, P., MCGRATH, M. and PITMAN, J. 1995. Riffle shuffles, cy cles, and descents, Combinatorica 15 11 29. MR1325269 10.1007/BF012944575 DIACONIS, P., MCGRATH, M. and PITMAN, J. 1995. Riffle shuffles, cy cles, and descents, Combinatorica 15 11 29. MR1325269 10.1007/BF01294457
6 LALLEY, S. P. 1996. Cy cle structure of riffle shuffles. Ann. Probab. 24 49 73. MR97d:05018 0854.05007 10.1214/aop/1042644707 euclid.aop/1042644707
6 LALLEY, S. P. 1996. Cy cle structure of riffle shuffles. Ann. Probab. 24 49 73. MR97d:05018 0854.05007 10.1214/aop/1042644707 euclid.aop/1042644707
7 MANN, B. 1995. How many times should you shuffle a deck of cards? In Topics in ContempoZ. rary Probability and Its Applications J. Laurie Snell, ed. 28 261 289. CRC Press, Boca Raton, FL. MR1410540 0864.600057 MANN, B. 1995. How many times should you shuffle a deck of cards? In Topics in ContempoZ. rary Probability and Its Applications J. Laurie Snell, ed. 28 261 289. CRC Press, Boca Raton, FL. MR1410540 0864.60005
8 RIORDAN, J. 1979. Combinatorial Identities. Krieger, Huntington, NY. MR80k:050018 RIORDAN, J. 1979. Combinatorial Identities. Krieger, Huntington, NY. MR80k:05001