论文标题
超图和其他相关几何和离散结构上的公正联合游戏
Take-Away Impartial Combinatorial Games on Hypergraphs and Other Related Geometric and Discrete Structures
论文作者
论文摘要
在HyperGraphs上的外卖游戏中，两名玩家轮流删除了超图的顶点和超琴。在每个回合中，玩家必须删除单个顶点或HyperEdge。当播放器选择删除一个顶点时，所有包含所选顶点的Hyperedges也将被删除。当玩家选择删除一个HyperEdge时，只有选择的HyperEdge被删除。删除最后一个顶点的人赢得了比赛。从仅在奇怪的统一或仅均匀统一的超图上进行外卖公正的组合游戏的获胜策略之后，本文是关于在既不奇怪又均匀统一的超透明游戏上的新的获胜策略。但是，这些既不奇怪，均匀均匀的超图，必须满足特定的给定要求。
In a Take-Away Game on hypergraphs, two players take turns to remove the vertices and the hyperedges of the hypergraphs. In each turn, a player must remove either a single vertex or a hyperedge. When a player chooses to remove one vertex, all of the hyperedges that contain the chosen vertex are also removed. When a player chooses to remove one hyperedge, only that chosen hyperedge is removed. Whoever removes the last vertex wins the game. Following from the winning strategy for the Take-Away Impartial Combinatorial Games on only Oddly Uniform or only Evenly Uniform Hypergraphs, this paper is about the new winning strategy for Take-Away Games on neither Oddly nor Evenly Uniform Hypergraphs. These neither Oddly nor Evenly Uniform Hypergraphs, however, have to satisfy the specific given requirements.
