arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.0773cs.DScs.DM
收藏

第1035章玩起了多色的主谋

Playing Mastermind with Many Colors

Benjamin Doerr, Carola Doerr, Reto Spöhel, Henning Thomas

摘要:

我们分析的经典猜谜游戏的一般版本的主谋与$n$的立场和$k$颜色。由于情况$k \le n^{1-\varepsilon}$,$\varepsilon>0$一个常数,是很好理解的,我们集中在更大的颜色数。对于最突出的情况$k = n$,我们的结果意味着,密码破译器可以找到秘密代码与$O(n \log \log n)$猜测。这个界限在只使用黑色答案钉时也有效。它改进了Chvátal(Combinatorica 3(1983),325- 329)首先证明的$O(n \log n)$界。我们还表明,如果黑色和白色的答案钉都使用,那么$O(n \log\log n)$绑定持有高达$n^2 \log\log n$颜色。这些边界几乎是紧的,如已知的$Ω(n)$的下界所示。与$k \le n^{1-\varepsilon}$不同,仅仅随机猜测直到确定密码是不够的。事实上,我们表明,一个最佳的非自适应策略(确定性或随机)需要$Θ(n \log n)$猜测。

英文摘要:

We analyze the general version of the classic guessing game Mastermind with $n$ positions and $k$ colors. Since the case $k \le n^{1-\varepsilon}$, $\varepsilon>0$ a constant, is well understood, we concentrate on larger numbers of colors. For the most prominent case $k = n$, our results imply that Codebreaker can find the secret code with $O(n \log \log n)$ guesses. This bound is valid also when only black answer-pegs are used. It improves the $O(n \log n)$ bound first proven by Chvátal (Combinatorica 3 (1983), 325--329). We also show that if both black and white answer-pegs are used, then the $O(n \log\log n)$ bound holds for up to $n^2 \log\log n$ colors. These bounds are almost tight as the known lower bound of $Ω(n)$ shows. Unlike for $k \le n^{1-\varepsilon}$, simply guessing at random until the secret code is determined is not sufficient. In fact, we show that an optimal non-adaptive strategy (deterministic or randomized) needs $Θ(n \log n)$ guesses.

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

↑