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

公平组合对策的余有限诱导子图:CIS-Nim分析

Cofinite Induced Subgraphs of Impartial Combinatorial Games: An Analysis of CIS-Nim

Scott M. Garrabrant, Eric J. Friedman, Adam Scott Landsberg

摘要:

给定一个公平的组合博弈G,我们通过在G中指定一个有限集的位置,并禁止参与者移动到这些位置来创建一类相关博弈(CIS-G)(保留所有其他博弈规则不变)。这样的修改相当于取原博弈图的余有限诱导子图(CIS)。最近的一些数值/启发式的工作表明,这种“CIS游戏”的基本结构和行为可以揭示新的光,并承担有趣的关系,从原来的游戏,他们是派生。本文给出了(三堆)Nim博弈的上有限诱导子图的一个解析处理。这是CIS博弈中最简单的非平凡情形之一。我们的主要发现是,尽管CIS-Nim博弈中获胜策略的结构与Nim博弈中获胜策略的结构有很大不同,但CIS-Nim博弈继承了Nim博弈中的周期二尺度不变性。

英文摘要:

Given an impartial combinatorial game G, we create a class of related games (CIS-G) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such modifications amount to taking cofinite induced subgraphs (CIS) of the original game graph. Some recent numerical/heuristic work has suggested that the underlying structure and behavior of such "CIS-games" can shed new light on, and bears interesting relationships with, the original games from which they are derived. In this paper we present an analytical treatment of the cofinite induced subgraphs associated with the game of (three-heap) Nim. This constitutes one of the simplest nontrivial cases of a CIS game. Our main finding is that although the structure of the winning strategies in games of CIS-Nim can differ greatly from that of Nim, CIS-Nim games inherit a type of period-two scale invariance from the original game of Nim.

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

↑