论文部分内容阅读
目前,虽然已有了中国象棋知识的模式表示法,但是要实现一个博弈程序还需有评价函数和搜索算法.树搜索算法较多,在使左结点以某种大的概率生成得比右结点更好这样一个程序目标下,我们选择了α-β算法。本文所讨论的博弈树搜索的方法和思想,已成功地在 IBM-PC/XT 机上实现(程序名为 C-CHESS).
At present, although there has been a pattern representation of Chinese chess knowledge, it is still necessary to have an evaluation function and a search algorithm in order to implement a game program. There are many tree search algorithms that generate left nodes with a greater probability than right The knot is better Under such a program goal, we chose the alpha-beta algorithm. The methods and ideas of game tree search discussed in this paper have been successfully implemented on IBM-PC / XT machines (program name is C-CHESS).