arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0803.0156math.CO
收藏

如何玩Dundee

How to Play Dundee

Kevin Liwack, Oleg Pikhurko, Suporn Pongnumkul

摘要:

我们考虑下面的单人游戏称为邓迪。我们得到一副由s_i张价值为i的牌组成的牌,其中i=1,...,v和整数m \le s_1+.+ s_v.有m发子弹。在每一轮中,玩家说出1到v之间的一个数字,然后从牌堆中随机抽取一张牌。如果指定的数字在至少一轮中与抽到的值重合,则玩家输。Monmort在1708年提出了著名的13问题,要求在v=13,s_1=...=...的情况下获胜的概率。s_{13} =4,m=13,并且玩家将序列命名为1,.,13.这个问题和它的各种推广被许多数学家研究过,包括J.和N.伯努利,德莫弗,欧拉,加泰罗尼亚,和其他人。然而,似乎没有人考虑过玩家的哪种策略最大化获胜的概率。我们研究这个问题的两个变种。在第一个变体中,玩家在第i轮中的出价可以取决于在先前轮中抽取的随机牌的值。我们完全解决了这个版本。在第二种变体中,玩家必须在转任何牌之前预先指定m个出价的整个序列。当s_1=.=时,我们能够解决这个问题。s_v和m是任意的。

英文摘要:

We consider the following one-player game called Dundee. We are given a deck consisting of s_i cards of Value i, where i=1,...,v, and an integer m\le 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 Monmort 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑