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

DOI: 10.1007/978-3-540-73325-6_112

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4570)
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

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.

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