足球残局很难
Phutball Endgames are Hard
摘要:
我们表明,在约翰康威的棋盘游戏足球(或哲学家的足球),这是NP完全确定当前的球员是否有一个举动,立即赢得比赛。相比之下,类似的问题,即确定跳棋中是否有一个立即获胜的移动,或者一个国王的移动,都可以在多项式时间内解决。
英文摘要:
We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins the game. In contrast, the similar problems of determining whether there is an immediately winning move in checkers, or a move that kings a man, are both solvable in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。