arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.02353cs.GT
收藏

最多43步,至少29步:终极井字游戏的最优策略和界限

At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe

Guillaume Bertholon, Rémi Géraud-Stewart, Axel Kugelmann, Théo Lenoir, David Naccache

摘要:

Ultimate Tic-Tac-Toe是著名的井字游戏(noughts and crosses)的变体。两个玩家竞争赢得三个对齐的“领域”,每个领域都是一个井字游戏。每一步都决定了下一个玩家必须在哪个领域比赛。我们发现,存在一个获胜的策略,为第一个球员,因此,存在一个最佳的获胜策略,采取最多43个动作,第二个球员可以举行至少29轮,并确定任何最佳策略的前两个动作。

英文摘要:

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-toe game. Each move determines which field the next player must play in. We show that there exist a winning strategy for the first player, and therefore that there exist an optimal winning strategy taking at most 43 moves; that the second player can hold on at least 29 rounds; and identify any optimal strategy's first two moves.

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

↑