Study on Loop Problem in Opening Database for Chinese Chess Programs
- Cite this paper as:
- Yen SJ., Yang TN., Chen JC., Hsu SC. (2007) Study on Loop Problem in Opening Database for Chinese Chess Programs. In: Okuno H.G., Ali M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science, vol 4570. Springer, Berlin, Heidelberg
A Chinese chess program systematically constructs a large tree-based opening database by collecting knowledge from chess masters, books and game records in the opening phrase. However, those games with loops are not managed properly in the database. The perpetual situations are not recorded correctly in the database, and therefore the program will play a draw in an advantageous position and a loss in a draw position. This study describes a solution to the loop problem in opening database.
Keywordsheuristic search computer Chinese chess opening database loop problems
Unable to display preview. Download preview PDF.