组合对策论、适度得分对策和结对策
Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game
摘要:
我们首先回顾和证明组合对策论的基本事实。然后,我们考虑得分游戏(也称为米尔诺游戏或位置游戏),专注于“固定长度”的游戏,其中所有的游戏序列在相同数量的移动后终止。固定长度的得分游戏的理论被证明具有类似于循环组合游戏的理论,与操作类似的onsides和offsides的属性。我们用短分对策类给出了定长得分对策的结构的完整描述。我们还考虑了在二元布尔代数中取值的固定长度的得分游戏,并将这些游戏分类为不可分的。然后,我们应用这些结果来分析Pechenik,Townsend,Henrich,MacNaughton和Silversmith的打结-解开游戏中的一些位置。
英文摘要:
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate after the same number of moves. The theory of fixed-length scoring games is shown to have properties similar to the theory of loopy combinatorial games, with operations similar to onsides and offsides. We give a complete description of the structure of fixed-length scoring games in terms of the class of short partizan games. We also consider fixed-length scoring games taking values in the two-element boolean algebra, and classify these games up to indistinguishability. We then apply these results to analyze some positions in the knotting-unknotting game of Pechenik, Townsend, Henrich, MacNaughton, and Silversmith.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。