多方向井字棋的几乎最优配对策略
Almost optimal pairing strategy for Tic-Tac-Toe with numerous directions
摘要:
我们发现,有一个$m=2n+o(n)$,这样,在制造商-断路器游戏发挥$\Z^d$在制造商需要把至少$m$他的标记连续在一个$n$给定的获胜方向,断路器可以迫使平局使用配对策略。这改进了Kruczek和Sundberg的结果,他们表明,如果$m\ge 3n$,则存在这样的配对策略。一个简单的论点表明,$m$必须至少是$2n+1$,如果断路器只允许使用配对策略,因此我们的界的主要条款是最优的。
英文摘要:
We show that there is an $m=2n+o(n)$, such that, in the Maker-Breaker game played on $\Z^d$ where Maker needs to put at least $m$ of his marks consecutively in one of $n$ given winning directions, Breaker can force a draw using a pairing strategy. This improves the result of Kruczek and Sundberg who showed that such a pairing strategy exits if $m\ge 3n$. A simple argument shows that $m$ has to be at least $2n+1$ if Breaker is only allowed to use a pairing strategy, thus the main term of our bound is optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。