The card guessing game: A generating function approach
Consider a card guessing game with complete feedback in which a deck of n cards ordered 1,…,n is riffle-shuffled once. With the goal to maximize the number of correct guesses, a player guesses cards from the top of the deck one at a time under the optimal strategy until no cards remain. We provide a...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/80194 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85134832435&origin=inward |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Mahidol University |
| Summary: | Consider a card guessing game with complete feedback in which a deck of n cards ordered 1,…,n is riffle-shuffled once. With the goal to maximize the number of correct guesses, a player guesses cards from the top of the deck one at a time under the optimal strategy until no cards remain. We provide an expression for the expected number of correct guesses with arbitrary number of terms, an accuracy improvement over the results of Liu (2021). In addition, using generating functions, we give a unified framework for systematically calculating higher-order moments. Although the extension of the framework to k≥2 shuffles is not immediately straightforward, we are able to settle a long-standing McGrath's conjectured optimal strategy described in Bayer and Diaconis (1992) by showing that the optimal guessing strategy for k=1 riffle shuffle does not necessarily apply to k≥2 shuffles. |
|---|