Study on Loop Problem in Opening Database for Chinese Chess Programs
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.
- 1.Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands (1994) ISBN 90-9007488-0Google Scholar
- 2.Asian Xiangqi Federation (in Chinese) (2003), http://tysung.cjb.net/xq/index.html
- 4.Huang, S.L.: Strategies of Chinese Chess Opening. World Culture Inc. Press (1991)Google Scholar
- 5.Hsu, S.C., Tsao, K.M.: Design and Implementation of an Opening Game Knowledge-Base System for Computer Chinese Chess (in Chinese). Bulletin of the College of Engineering, N.T.U., (53), 75–86 (1988)Google Scholar
- 7.Lincke, T.R.: Strategies for the Automatic Construction of Opening Books. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 74–86. Springer, Heidelberg (2002)Google Scholar
- 8.Marsland, T.A.: A Review of Game-Tree Pruning. ICCA Journal 9(1), 3–19 (1986)Google Scholar
- 10.Walczak, S.: Improving Opening Book Performance through Modeling of Chess Opponents. In: ACM Conference on Computer Science, pp. 53–57. ACM Press, New York (1996)Google Scholar
- 11.Wu, E.: English Translation Drafts of Asian Rules (2002), http://www.clubxiangqi. com/ rules/
- 12.Yen, S.J., Chen, J.C., Yang, T.N., Hsu, S.C.: Computer Chinese Chess. ICGA Journal 27(1), 3–18 (2004)Google Scholar