Study on Loop Problem in Opening Database for Chinese Chess Programs

  • Shi-Jim Yen
  • Tai-Ning Yang
  • Jr-Chang Chen
  • Shun-Chin Hsu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4570)

Abstract

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.

Keywords

heuristic search computer Chinese chess opening database loop problems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Asian Xiangqi Federation (in Chinese) (2003), http://tysung.cjb.net/xq/index.html
  3. 3.
    Bouzy, B., Cazenave, T.: Computer Go: An AI oriented survey. Artificial Intelligence 132, 39–103 (2001)MATHCrossRefGoogle Scholar
  4. 4.
    Huang, S.L.: Strategies of Chinese Chess Opening. World Culture Inc. Press (1991)Google Scholar
  5. 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
  6. 6.
    Iida, H., Sakut, M., Rollason, J.: Computer Shogi. Artificial Intelligence 134, 121–144 (2002)MATHCrossRefGoogle Scholar
  7. 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. 8.
    Marsland, T.A.: A Review of Game-Tree Pruning. ICCA Journal 9(1), 3–19 (1986)Google Scholar
  9. 9.
    Shannon, C.E.: Programming a Computer for Playing Chess. Philosophical Magazine 41, 256–257 (1950)MATHGoogle Scholar
  10. 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. 11.
    Wu, E.: English Translation Drafts of Asian Rules (2002), http://www.clubxiangqi. com/ rules/
  12. 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

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Shi-Jim Yen
    • 1
  • Tai-Ning Yang
    • 2
  • Jr-Chang Chen
    • 3
  • Shun-Chin Hsu
    • 4
  1. 1.Department of Computer Science and Information Engineering, National Dong Hwa University, HualienTaiwan
  2. 2.Department of Computer Science, Chinese Culture University, TaipeiTaiwan
  3. 3.Department of Applied Mathematics, Chung Yuan Christian University, Chung LiTaiwan
  4. 4.Department of Information Management, Chang Jung Christian University, TainanTaiwan

Personalised recommendations