Research Of Chinese Chess Search Engine Based On Pruning Strategy

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.