论文标题
烦恼的杂项逻辑
Vexing Vexillological Logic
论文作者
论文摘要
我们根据洪水填充定义了一种新的公正组合游戏，即国旗着色。然后，我们将其推广到一个图游戏，并在两种颜色上找到许多位置的值。我们证明，通过避免True的减少，确定基于现实世界标志的游戏的结果类别，并讨论剩余的开放问题，可以通过避免True的减少，确定游戏的结果类别，从而对两种或更多颜色进行PSPACE组成。
We define a new impartial combinatorial game, Flag Coloring, based on flood filling. We then generalize to a graph game, and find values for many positions on two colors. We demonstrate that the generalized game is PSPACE-complete for two colors or more via a reduction from Avoid True, determine the outcome classes of games based on real-world flags, and discuss remaining open problems.
