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

关于某些无限家族慢A-尼姆游戏的P位置

On the $\mathcal{P}$-positions of some infinite families of Slow $A$-Nim

Department of Mathematics, University of Quebec, Montreal(蒙特利尔魁北克大学数学系);Department of Mathematics, Cal State LA(加州州立大学洛杉矶分校数学系)

Silvia Heubach, Matthieu Dufour

AI总结:

本文研究了慢A-尼姆游戏的P位置,针对A={n-1}、A={n-1,n}和A={1,n}三种无限家族,揭示了其P位置的优雅描述及一般性结论。

摘要:

我们介绍了慢A-尼姆游戏,该游戏扩展了若干最近研究的游戏。慢A-尼姆游戏在n堆筹码上进行,集合A表示玩家可操作的堆数。一旦玩家决定数a,他们将选择任意a堆并从每堆中移除一个筹码。最后移动的玩家获胜。我们给出了慢A-尼姆游戏几个无限家族的P位置结果。对于A={n-1},即慢精确k-尼姆游戏(k=n-1)的结果扩展了近期对小n值的研究。其他两个家族A={n-1,n}和A={1,n}此前未被研究。A={n-1}和A={n-1,n}的P位置密切相关,其描述非常优雅,涉及简化位置,即忽略不可操作的筹码。我们还提供了一些一般性结论,将在研究其他集合A时有所帮助。

英文摘要:

We introduce the game Slow $A$-Nim which generalizes a number of recently studied games. Slow $A$-Nim is played on $n$ stacks of tokens, and the set $A$ indicates the number of stacks a player can play on. Once a player has decided on the number $a$ of stacks, s/he will select any $a$ stacks and then remove one token from each stack. The last player to move wins. We give results on the $\mathcal{P}$-positions of Slow $A$-Nim for several infinite families. The results for $A = \{n-1\}$, which is the game Slow Exact $k$-Nim for $k=n-1$ extend recent results for small values of $n$. The other two families, $A=\{n-1,n\}$ and $A=\{1,n\}$ have not been previously studied. The $\mathcal{P}$-positions for $A = \{n-1\}$ and $A = \{n-1,n\}$ are closely related and have a very elegant description in terms of reduced positions, that is, positions for which unplayable tokens are disregarded. We also provide some general results that will be useful in the study of other sets $A$.

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

↑