A simple card guessing game revisited
The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2
A deck of cards consisting of $m$ red and $n$ black cards is given. A guess is made as to the colour of the top card, after which it is revealed and discarded. To maximise the number of correct guesses one chooses the colour corresponding to the majority of cards remaining in the deck. We determine the expected number of correct guesses with this strategy, as well as the probability of beating an opponent who uses the naive stategy of random guessing.
DOI :
10.37236/1612
Classification :
05A15, 60C05
Mots-clés : generating function, recurrence relation
Mots-clés : generating function, recurrence relation
@article{10_37236_1612,
author = {Arnold Knopfmacher and Helmut Prodinger},
title = {A simple card guessing game revisited},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {2},
doi = {10.37236/1612},
zbl = {0991.05004},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1612/}
}
Arnold Knopfmacher; Helmut Prodinger. A simple card guessing game revisited. The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2. doi: 10.37236/1612
Cité par Sources :