摘要
通过对传统博弈树搜索算法的修改,提出了一种中国象棋残局棋谱的自动生成算法,该算法基于极深极浅算法,并用剪枝、着法排序、置换表等手段对其搜索效率进行了优化.实验数据表明该算法在搜索生成连照胜杀局的棋谱时,具有较好的效果.最后用该算法对《象棋残局杀局宝典》中的残局进行了验证,发现了书中记录的残局棋谱存在的一些错误.
Through modifying the traditional search algorithms of game tree,an automatic generation algorithm for the manual of Chinese chess endgames is put forward.The algorithm is based on the deepest and shallowest search algorithm proposed in this paper,and is optimized by pruning,transposition table,move sort,etc.The experimental data show that this algorithm has fairly good results for the endgames by successive checks for winning.Finally,the endgames in the Well-known Chinese Chess Endgames are verified by this algorithm and some errors are found in this chess manual.
出处
《云南民族大学学报（自然科学版）》
CAS
2010年第6期435-438,共4页
Journal of Yunnan Minzu University:Natural Sciences Edition
关键词
中国象棋
残局
棋谱
博弈树
搜索算法
Chinese chess
endgame
chess manual
game tree
search algorithm
