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

transversal 游戏

The transversal game

Žarko Ranđelović

AI总结:

本文研究在 n×n 网格中轮流占据空格以率先形成 transversal 的二人游戏,证明了当 n≥4 时先手玩家具有必胜策略,从而回答了 Erickson 提出的问题。

摘要:

两名玩家轮流从 $n\times n$ 网格中占据空格。率先占据一条 transversal(即由 $n$ 个单元格组成、且任意两个单元格均不在同一行或同一列的集合)的玩家获胜。在最优策略下,该游戏的结果如何?本文旨在证明:当 $n\ge 4$ 时,先手玩家拥有必胜策略。这回答了 Erickson 提出的一个问题。

英文摘要:

Two players take turns claiming empty cells from an $n\times n$ grid. The first player (if any) to occupy a transversal (a set of $ n $ cells having no two cells in the same row or column) is the winner. What is the outcome of the game given optimal play? Our aim in this paper is to show that for $n\ge 4$ the first player has a winning strategy. This answers a question of Erickson. We also consider variants of the game in which the family of winning transversals is restricted, both in the original game and in its Maker--Breaker version.

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

↑