项链游戏
Necklace Games
AI总结:
本文定义并研究了项链尼姆游戏NN(n,k),该游戏是路径尼姆游戏PN(n,k)的扩展,其解法对解决圆尼姆游戏至关重要。研究了当允许在至少一半堆上进行游戏时的无限家族解。
摘要:
我们定义并研究了项链尼姆游戏NN(n,k),该游戏是路径尼姆游戏PN(n,k)的扩展,其解法对解决圆尼姆游戏至关重要。研究了当允许在至少一半堆上进行游戏时的无限家族解。
英文摘要:
We define and give results on the game NecklaceNim NN($n$,$k$) which is PathNim PN($n$,$k$) with an additional move allowed on the end vertices. This game arises as a sub-game in the context of solving CircularNim CN($n$,$k$) when $k-2$ consecutive stacks have been depleted, therefore its solution is critical to solving CircularNim. We solve the infinite families of NN($n$,$k$) when play is allowed on at least half the stacks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。