arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.09402math.CO
收藏

偏序集对策上寻找理想对策的进展

Advances in finding ideal play on poset games

Alexander Clow, Stephen Finbow

摘要:

偏序集对策是一类尚未解决的组合对策。Soltys和Wilson证明了计算获胜策略是在\textbf{PSPACE}中进行的,除了Nim和N-Free游戏等特殊情况外,寻找理想策略的\textbf{P}时间算法是未知的。本文提出了一种计算偏序集对策数的方法,这种偏序集对策数可以对胜负位置进行分类。结果提出了一个等价的理想策略的偏序集是看似无关的。

英文摘要:

Poset games are a class of combinatorial game that remain unsolved. Soltys and Wilson proved that computing wining strategies is in \textbf{PSPACE} and aside from special cases such as Nim and N-Free games, \textbf{P} time algorithms for finding ideal play are unknown. This paper presents methods calculate the nimber of posets games allowing for the classification of winning or losing positions. The results present an equivalence of ideal strategies on posets that are seemingly unrelated.

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

↑