The Research Of Chinese Chess Based On Database With Self Learning

The research of Chinese chess computer game starts later than chess, but develops quickly. So far there are many excellent Chinese chess programs, such as the "ELP" developed by Shun-Chih Hsu and his team, the "Elephant eye" developed by Chen Huang and so on. Most of the existing Chinese chess programs are improved through optimizing the data structure and improving the search strategy. Self-learning programs have rarely appeared.This thesis proposes a method that can change strategy and avoid making the same mistakes through searching the database with which it stores the'opponent movement computer has misjudged and the position value. In other words, it has the ability of self-learning.Game-tree search is one of the key technologies in Chinese Chess computer game. Game-tree search can achieve self-learning with a database. Fu qiang produced a method which used database to record the best movement and position value, then amended the position value by reinforcement learning to achieve the purpose of study.That Chinese Chess software lost game is mainly because of the opponent movement computer has misjudged. In this thesis, the opponent movements which are different from what computer forecasts and the return value of game-tree are recorded and the key movement and the value that cause failure are chosen. When meeting the same movement, it will read the value of the movement and continue to search. It will change the strategy so that it achieves the ability of self-learning.