摘要
针对中国象棋机器博弈中较为高效的Alpha-Beta搜索算法进行研究,以提升其效率.依据Alpha-Beta搜索算法的效率与子节点扩展的排列顺序高度相关的事实及中国象棋自身的特点,本研究从优化着法的排列顺序入手,设计出了启发能力较强的着法排列方案,并进一步提出了扩大窗口的内部迭代加深算法对上述着法排列方案进行修正,从而使着法顺序得到了进一步的优化.实验数据证明,本研究明显提升了Alpha-Beta算法的效率.
Alpha-Beta search algorithm in computerized Chinese chess is investigated. Based on characteristics of Chinese chess and the fact that algorithm efficiency is highly affected by move ordering, a move ordering scheme that achieved higher heuristic effect was designed, and proposed new algorithm internal iterative deepening with enlarged window, to revise move ordering scheme. With this algorithm, move ordering has been further optimized. Experimental data showed markedly enhanced efficiency and performance of Alpha-Beta search algorithm.
出处
《北京师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2009年第2期156-160,共5页
Journal of Beijing Normal University(Natural Science)
基金
国家自然科学基金资助项目(60273015)
