In this article, we prove the completeness of the following game search algorithms: unbounded best-first minimax with completion and descent with completion, i.e. we show that, with enough time, they find the best game strategy. We then generalize these two algorithms in the context of perfect information multiplayer games. We show that these generalizations are also complete: they find one of the equilibrium points.
翻译:在文章中,我们证明了下列游戏搜索算法的完整性:无限制的首个最小型算法,完成和下降,完成,也就是说,我们证明,只要有足够的时间,他们就能找到最佳的游戏策略。然后,我们用完美的信息多玩者游戏来概括这两种算法。我们证明,这些简单化也是完整的:他们找到一个平衡点。