完善2人独棋的复杂性分类:骑士和国王是困难的
Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard
AI总结:
本文研究2人独棋问题,证明仅含骑士或国王时问题为NP难,完善了该问题的复杂性分类。
摘要:
我们扩展了2022年由Aravind, Misra和Mittal首次引入的2人独棋问题研究。2人独棋是单人国际象棋变种,玩家必须通过捕获使棋盘上仅剩一个棋子,每个棋子最多捕获两次。已知仅含兵时问题可在多项式时间内解决,而仅限车、象或后时问题变为NP难。本文通过证明仅含骑士或仅含国王时问题仍为NP难,完善了该问题的复杂性分类。
英文摘要:
We extend the study of the 2-Solo Chess problem which was first introduced by Aravind, Misra, and Mittal in 2022. 2-Solo Chess is a single-player variant of chess in which the player must clear the board via captures such that only one piece remains, with each piece capturing at most twice. It is known that the problem is solvable in polynomial time for instances containing only pawns, while it becomes NP-complete for instances restricted to rooks, bishops, or queens. In this work, we complete the complexity classification by proving that 2-Solo Chess is NP-complete if the instance contains only knights or only kings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。