【作者】 裴祥豪；

【导师】 王熙照； 翟俊海；

【作者基本信息】 河北大学 ， 计算机软件与理论， 2009， 硕士

【摘要】 在人工智能(AI)领域,计算机博弈历来都是一个重要的研究方向。对中国象棋计算机博弈的研究始于上世纪八十年代,经过二十多年的努力,出现了大量优秀的博弈系统,在对弈能力方面,有些系统目前已经达到了专家级水平。然而与国际象棋所取得的成就相比仍有较大差距。本文针对中国象棋博弈系统的搜索引擎进行研究,主要分析了各种基于剪枝策略的搜索算法应用于中国象棋博弈时表现出来的特点和性能,总结出了除算法之外其他影响系统棋力的因素以及改进的方法。B*算法很少被应用于中国象棋博弈系统之中,本文实现了基于最佳优先搜索的B*算法,并设计了适合此算法的局面评估函数。在实验中详细分析了B*算法的优缺点和实战能力,实验结果证明B*算法应用于中国象棋博弈系统当中是可行的。更多还原

【Abstract】 Computer game playing is a very important domain in Artificial Intelligence(AI). The research of Chinese Chess Computer Game started from the 1980s. After more than 20 years’ development, many excellent game playing systems have emerged. Some of them have reached the human expert-level. However, comparing with the achievements of international chess systems, Chinese chess systems need to be improved.In this thesis, the search engine of Chinese chess system is studied and the performance of search algorithms is analyzed. Some factors which can influence the systems’capability are studied and methods witch can improve the capability of the chess system are introduced. B* algorithm, witch is rarely used in Chinese chess system, is applied to our system. An evaluation function is constructed and combined with B*. The advantages, disadvantages and performance of B* algorithm are analyzed. Experimental results show that B* algorithm is feasible and effective in Chinese chess system.更多还原