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

游戏名称:Pattern Avoidance Games

Results on Pattern Avoidance Games

P. A. CrowdMath

摘要:

一个0 - 1矩阵$A$包含另一个0 - 1矩阵$P$,如果$A$的某个子矩阵可以通过将某些1变为0而变换为$P$。如果$A$不包含$P$,则$A$会避免$P$。模式回避游戏由两名玩家玩。从一个全零矩阵开始,两个参与者轮流将0变为1,同时保持$A$避开$P$。我们研究了这种博弈对于某些模式$P$的策略。我们还研究了这个博弈的一些推广。

英文摘要:

A zero-one matrix $A$ contains another zero-one matrix $P$ if some submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. $A$ avoids $P$ if $A$ does not contain $P$. The Pattern Avoidance Game is played by two players. Starting with an all-zero matrix, two players take turns changing zeros to ones while keeping $A$ avoiding $P$. We study the strategies of this game for some patterns $P$. We also study some generalizations of this game.

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

↑