论文标题

关于误会的公正游戏的结构

On the Structure of Misère Impartial Games

论文作者

Siegel, Aaron N.

论文摘要

我们考虑了MISère公正游戏值的Monoid M的抽象结构。提出了一些新的结果,包括证明M的一组几乎没有扭转;一种计算第7天出生的独特游戏数量的方法;以及有关主要游戏结构的一些新结果。还包括由于康威(Conway)引起的一些较旧结果的证据,例如取消定理,这些结果对于分析至关重要,但文献中不容易获得证明。 这里介绍的许多工作都是与约翰·康威(John Conway)和丹·霍伊(Dan Hoey)共同完成的,我将本文献给他们的记忆。

We consider the abstract structure of the monoid M of misère impartial game values. Several new results are presented, including a proof that the group of fractions of M is almost torsion-free; a method of calculating the number of distinct games born by day 7; and some new results on the structure of prime games. Also included are proofs of a few older results due to Conway, such as the Cancellation Theorem, that are essential to the analysis but whose proofs are not readily available in the literature. Much of the work presented here was done jointly with John Conway and Dan Hoey, and I dedicate this paper to their memory.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源