食人动物游戏:井字游戏的新变种
Cannibal Animal Games: a new variant of Tic-Tac-Toe
摘要:
本文提出了一种新的部分两人游戏,称为\emph{cannibal animal game},这是一个变种的井字游戏。游戏在无限网格上进行,每一轮玩家选择并占据自由单元格。第一个玩家Alice可以在每个回合中占据一个单元,并且如果她占据一组单元,则她获胜,该组单元的子集的并集是先前商定的polyomino $P$(称为\emph{animal})的平移、反射和/或旋转副本。第二玩家Bob的目的是防止Alice通过在每一轮中占据$P$的平移、反射和/或旋转副本来创建她的动物。如果Bob有获胜策略,则动物是\emph{cannibal},否则是\emph{non-cannibal}。本文介绍了一些新的工具,如\emph{bounding strategy}和\emph{punching lemma},分类动物食人或非食人。我们还表明,该\emph{pairing strategy}工程这个问题。
英文摘要:
This paper presents a new partial two-player game, called the \emph{cannibal animal game}, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice can occupy a cell in each turn and wins if she occupies a set of cells, the union of a subset of which is a translated, reflected and/or rotated copy of a previously agreed upon polyomino $P$ (called an \emph{animal}). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated, reflected and/or rotated copy of $P$. An animal is a \emph{cannibal} if Bob has a winning strategy, and a \emph{non-cannibal} otherwise. This paper presents some new tools, such as the \emph{bounding strategy} and the \emph{punching lemma}, to classify animals into cannibals or non-cannibals. We also show that the \emph{pairing strategy} works for this problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。