Knowledge Inferencing on Chinese Chess Endgames

  • Bo-Nian Chen
  • Pangfeng Liu
  • Shun-Chin Hsu
  • Tsan-sheng Hsu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5131)


Several Chinese chess programs exhibit grandmaster playing skills in the opening and middle game. However, in the endgame phase, the programs only apply ordinal search algorithms; hence, they usually cannot exchange pieces correctly. Some researchers use retrograde algorithms to solve endgames with a limited number of attack pieces, but this approach is often not practical in a real tournament. In a grandmaster game, the players typically perform a sequence of material exchanges between the middle game and the endgame, so computer programs can be useful. However, there are about 185 million possible combinations of material in Chinese chess, and many hard endgames are inconclusive even to human masters. To resolve this problem, we propose a novel strategy that applies a knowledge-inferencing algorithm on a sufficiently small database to determine whether endgames with a certain combination of material are advantageous to a player. Our experimental results show that the performance of the algorithm is good and reliable. Therefore, building a large knowledge database of material combinations is recommended.


Material State Material Combination Knowledge Database Predictor Algorithm Unknown Material 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    van den Herik, H.J., Herschberg, I.S.: The construction of an omniscient endgame data base. ICCA Journal 8(2), 66–87 (1985)Google Scholar
  2. 2.
    van den Herik, H.J., Herschberg, I.S., Nakad, N.: A six-men-endgame database: KRP(a2)KbBP(a3). ICGA Journal 10(4), 163–180 (1987)Google Scholar
  3. 3.
    Fang, H.R., Hsu, T.S., Hsu, S.C.: Construction of Chinese chess endgame databases by retrograde analysis. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 96–114. Springer, New York (2000)Google Scholar
  4. 4.
    Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the checkers 10-piece endgame databases. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games: Many Games, Many Challenges, vol. 10, pp. 193–210. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  5. 5.
    Pai, J.T.:ChineseChessEndgameDatabasesQuerySystem,
  6. 6.
    Thompson, K.: Retrograde analysis of certain endgames. ICCA Journal 9(3), 131–139 (1986)Google Scholar
  7. 7.
    Thompson, K.: 6-piece endgames. ICCA Journal 19(4), 215–226 (1996)Google Scholar
  8. 8.
    Lake, R., Schaeffer, J., Lu, P.: Solving large retrograde analysis problems using a network of workstations. In: Advances in Computer Chess 7, Maastricht, The Netherlands, pp. 135–162 (1994)Google Scholar
  9. 9.
    Nalimov, E.V., Haworth, G.M., Heinz, E.A.: Space-efficient indexing of endgame databases for chess. In: van den Herik, H.J., Monien, B. (eds.) Advances in Computer Chess 9, pp. 93–113 (2001)Google Scholar
  10. 10.
    Wu, P.S., Liu, P.Y., Hsu, T.S.: An external-memory retrograde analysis algorithm. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 145–160. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Gasser, R.: Solving nine men’s morris. In: Nowakowski, R. (ed.) Games of No Chance. MSRI, vol. 29, pp. 101–113. Cambridge University Press, Cambridge (1996)Google Scholar
  12. 12.
    Wu, R., Beal, D.F.: Fast, Memory-Efficient Retrograde Algorithms. ICGA Journal 24(3), 147–159 (2001)Google Scholar
  13. 13.
    Xu, Y.C.: YinChang Chess Road, Special Column 44-45. Yan Chen Ti Yu Newspaper Office (1997)Google Scholar
  14. 14.
    Yen, S.J., Chen, J.C., Yang, T.N., Hsu, S.C.: Computer Chinese Chess. ICGA Journal 27(1), 3–18 (2004)Google Scholar
  15. 15.
    CONTEMPLATION, A Chinese chess program,

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Bo-Nian Chen
    • 1
  • Pangfeng Liu
    • 1
  • Shun-Chin Hsu
    • 2
  • Tsan-sheng Hsu
    • 3
  1. 1.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipei 
  2. 2.Department of Information ManagementChang Jung Christian UniversityTainan
  3. 3.Institute of Information ScienceAcademia SinicaTaipei 

Personalised recommendations