关于Black-Peg AB-Mastermind的查询复杂度
On the Query Complexity of Black-Peg AB-Mastermind
摘要:
策划者博弈是两个参与人的不完全信息零和博弈。第一个玩家,称为codemaker,选择一个密码,第二个玩家,称为codebreaker,试图通过尽可能少的猜测来破解密码,利用每次猜测后由codemaker给出的信息。在本文中,我们考虑所谓的黑钉变体的主谋,其中唯一的信息有关的猜测是位置的数量,在该猜测符合密码。更准确地说,我们处理一个特殊版本的黑钉游戏与n孔和k<=n颜色,其中不允许重复的颜色。我们目前的上限和下限的猜测打破密码的数量。我们首先回到El Ouali和Sauerland(2013)引入的上界结果。对于k=n的情况,密码可以在少于(n-3)*ld(n)+5n/2个查询内被算法识别。这个结果改进了Ker-I Ko和Shia-Chung Teng(1985)的结果,几乎是原来的2倍。对于k>n的情形,我们证明了(n-1)*ld(n)+k+1问题的一个上界.此外,我们还证明了k=n的一个新的下界(推广),它将Berger等人(2016)的最近结果从n-log(log(n))改进为n。对于k>n的情况,我们也给出了k个查询的下界.
英文摘要:
Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the codemaker after each guess. In this paper, we consider the so called Black-Peg variant of Mastermind, where the only information concerning a guess is the number of positions in which the guess coincides with the secret code. More precisely, we deal with a special version of the Black-Peg game with n holes and k<=n colors where no repetition of colors is allowed. We present upper and lower bounds on the number of guesses necessary to break the secret code. We first come back to the upper bound results introduced by El Ouali and Sauerland (2013). For the case k=n the secret code can be algorithmically identified within less than (n-3)*ld(n)+5n/2 queries. That result improves the result of Ker-I Ko and Shia-Chung Teng (1985) by almost a factor of 2. For the case k>n we prove an upper bound for the problem of (n-1)*ld(n)+k+1. Furthermore we prove a new lower bound for (a generalization of) the case k=n that improves the recent result of Berger et al. (2016) from n-log(log(n)) to n. We also give a lower bound of k queries for the case k>n.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。