Abstract:Combinatorial game theory is a branch of mathematics and theoretical computer science that studies deterministic games with perfect information and no elements of chance. The majority of combinatorial games are impartial and formalized in linear integer arithmetic, which we call LIA-definable impartial combinatorial games (ICGs). This paper studies decidability and undecidability questions for these games. We prove that deciding whether an LIA-definable ICG is terminating or cyclic is undecidable in general, while the corresponding questions become decidable for terminating LIA-definable ICGs. We also show that deciding whether an LIA formula exactly characterizes the set of winning, losing, or draw states of an LIA-definable ICG is undecidable in general and decidable for terminating LIA-definable ICGs. For state-level questions, deciding whether a state is winning or losing remains undecidable even for terminating LIA-definable ICGs, but becomes decidable for terminating finite-depth LIA-definable ICGs. Finally, deciding whether a state is draw for an LIA-definable ICG is undecidable in general and decidable for terminating LIA-definable ICGs.
From: Jiahao Luo [view email]
[v1]
Wed, 24 Jun 2026 01:28:19 UTC (58 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。