如何编写一个永不输棋的国际象棋引擎
How to program a never-losing chess engine
浏览论文内容
中文总结 AI 辅助
研究如何编写永不输棋的国际象棋引擎，基于图论提出模型，给出回溯极小化极大算法找完美策略，还给出变体算法确定存在至少平局的策略，从理论上证明其可行性。
中文摘要 AI 辅助
本文提出了一种基于图论的模型来表示诸如国际象棋和跳棋等各种完全信息两人游戏。接着提供了一种回溯极小化极大算法来寻找完美游戏策略（游戏解决方案），若存在的话。随后给出该算法的一个变体，用于确定一个较弱条件：存在永不输（至少达成平局）的策略。当然，这并非意味着算法能在短时间内找到这样的策略，本文仅关注从理论上形式化证明其可能性。
英文摘要
This article proposes a model, based on graph theory, to represent a variety of two-player games of perfect information, such as chess and checkers. I then provide a backtracking minimax algorithm to find, if it exists, a perfect game strategy (game resolution), and subsequently a way to exploit that algorithm to determine a weaker condition: the existence of a strategy to never lose (always reach at least a draw). Of course, this does not mean that in practice the algorithm can find such a strategy in a short time, but here we are only concerned with formally proving that this is possible, at least theoretically.
