圆形 Nim 游戏 CN(7,4)
Circular Nim CN(7,4)
AI总结：
本文研究圆形 Nim 游戏 CN(7,4)，刻画其 $\mathcal{P}$-局面结构，并发现其分裂为多个子集，区别于同类已知游戏。
摘要：
圆形 Nim 是一种双人无偏组合博弈，由放置在圆周上的 $n$ 堆代币组成。一步操作包括选择 $k$ 个连续的堆，并从其中一个或多个堆中取走至少一枚代币。最后一位能够进行操作的玩家获胜。人们关注的问题是：如果双方都采取最优策略，从给定局面出发谁能获胜？在无偏组合博弈中，只有两种类型的局面。$\mathcal{N}$-局面是指下一位行动的玩家拥有获胜策略的局面。$\mathcal{P}$-局面是指无论下一位玩家采取什么操作，都必然失败的局面。因此，通过识别 $\mathcal{P}$-局面，即可回答谁会获胜的问题。我们将证明关于 $n=7$、$k=4$ 时 $\mathcal{P}$-局面结构的结果，从而推广该博弈族中其他游戏的已知结果。该游戏的 $\mathcal{P}$-局面集合有一个有趣特征：它会分裂为不同的子集，这不同于该博弈族中已知游戏的结构。
英文摘要：
Circular Nim is a two-player impartial combinatorial game consisting of $n$ stacks of tokens placed in a circle. A move consists of choosing $k$ consecutive stacks and taking at least one token from one or more of the stacks. The last player able to make a move wins. The question of interest is: Who can win from a given position if both players play optimally? In an impartial combinatorial game, there are only two types of positions. An $\mathcal{N}$-position is one from which the next player to move has a winning strategy. A $\mathcal{P}$-position is one from which the next player is bound to lose, no matter what moves s/he makes. Therefore, the question who wins is answered by identifying the $\mathcal{P}$-positions. We will prove results on the structure of the $\mathcal{P}$-positions for $n = 7$ and $k = 4$, extending known results for other games in this family. The interesting feature of the set of $\mathcal{P}$-positions of this game is that it splits into different subsets, unlike the structure for the known games in this family.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
