尤其在游戏将结束时，战术比策略显得更为重要，AI就容易输棋(蒙特卡罗算法和极小极大算法都有这种问题)。
Especially, the AI starts losing out near the end game when tactics mean a lot more than overall strategy (which Monte Carlo and Minimax seem to do well at).
本文根据极大极小代数理论，给出了一种用以求解动态规划中有限多阶段决策问题的代数算法。
On the basis of minimax algebra theory, this paper provides an algebra method of solving countable stages decision problems in the dynamic programming.
基于潘家铮极大极小值原理，结合和声搜索算法提出了一种土坡稳定分析的新方法。
A new method of stability analysis of slopes is presented based on Panjiazheng extremum principle and harmony search method.
应用推荐