The Study And Improvement Of Search Alogrithm In Chinese Chess Computer Game

Computer chess game is one of the important parts in Artificial Intelligence (AI). After the invention of Computer, many people put their focus on research about computer chess game in order to make the computer player to be the same level as human player. There has been a decades term time competition between computer layers and human players. The accomplishment"Deep Blue"has acquired makes it famous in the world. That means the dream that the computer player conquer the human player come true.The research of computer Chinese chess game dropped behind about 30 years of the Chess game. But it also acquired some achievements. Many excellent game playing systems have emerged. In this thesis, we introduced the key technique of computer Chinese chess game, made the comparison among different search algorithms. We analyzed the action of the evaluation function and the assistant mechanism. We applied the best-first search algorithm in our system, and designed an evaluation function which is accord with this type of search strategy. With using this evaluation function, the system has reached a certain level. The experiment results indicate that this evaluation function is feasible and effective in computer Chinese chess game.