输给对手很难
Losing at Checkers is Hard
摘要：
我们证明了各种各样的跳棋的计算困难性：（1）决定是否有一个移动，迫使其他球员赢得在一个移动是NP完全的;（2）跳棋，球员必须总是能够跳到他们的回合是PSPACE完全的;（3）合作版本（1）和（2）是NP完全的。我们也给合作跳棋难题的解决方案是字母表中的字母。
英文摘要：
We prove computational intractability of variants of checkers: (1) deciding whether there is a move that forces the other player to win in one move is NP-complete; (2) checkers where players must always be able to jump on their turn is PSPACE-complete; and (3) cooperative versions of (1) and (2) are NP-complete. We also give cooperative checkers puzzles whose solutions are the letters of the alphabet.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
