Name
Abstract | ||
|---|---|---|
We consider the following one-player game called Dundee. We are given a deck consisting of si cards of Value i, where i = 1, ... ,v, and an integer m <= s(1) + ... +s(v). There are m rounds. In each round, the player names a number between 1 and v and draws a random card from the deck. The player loses if the named number coincides with the drawn value in at least one round. The famous Problem of Thirteen, proposed by Montmort in 1708, asks for the probability of winning in the case when v = 13, s(1) = ... = s(13) = 4, m = 13, and the player names the sequence 1, ... ,13. This problem and its various generalizations were studied by numerous mathematicians, including J. and N. Bernoulli, De Moivre, Euler, Catalan, and others. However, it seems that nobody has considered which strategies of the player maximize the probability of winning. We study two variants of this problem. In the first variant, the player's bid in Round i may depend on the values of the random cards drawn in the previous rounds. We completely solve this version. In the second variant, the player has to specify the whole sequence of m bids in advance, before turning any cards. We are able to solve this problem when s(1) = ... = s(v), and m is arbitrary. |
Year | Venue | Field |
|---|---|---|
2014 | ARS COMBINATORIA | Integer,Discrete mathematics,Catalan,Combinatorics,Generalization,Euler's formula,nobody,De Moivre's formula,Mathematics,Bernoulli's principle |
DocType | Volume | ISSN |
Journal | 115 | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kevin Litwack | 1 | 0 | 0.34 |
| Oleg Pikhurko | 2 | 318 | 47.03 |
| Suporn Pongnumkul | 3 | 105 | 5.10 |