Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases

  • Haw-ren Fang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3846)


Retrograde analysis has been successfully applied to solve Awari [6], and construct 6-piece Western chess endgame databases [7]. However, its application to Chinese chess is limited because of the special rules about indefinite move sequences. In [4], problems caused by the most influential rule, checking indefinitely, have been successfully tackled by Fang, with the 50 selected endgame databases were constructed in concord with this rule, where the 60-move rule was ignored. A conjecture is that other special rules have much less effect on staining the endgame databases, so that the corresponding stain rates are zero or small. However, the conjecture has never been verified before. In this paper, a rule-tolerant approach is proposed to verify this conjecture. There are two rule sets of Chinese chess: an Asian rule set and a Chinese rule set. Out of these 50 databases, 24 are verified complete with Asian rule set, whereas 21 are verified complete with Chinese rule set (i.e., not stained by the special rules). The 3 databases, KRKCC, KRKPPP and KRKCGG, are complete with Asian rule set, but stained by Chinese rules.


Boolean Function Special Rule Move Sequence Game Graph Rule Book 
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.
    China Xiangqi Association. The Playing Rules of Chinese Chess. Shanghai Lexicon Publishing Company (1999) (In Chinese)Google Scholar
  2. 2.
    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, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Fang, H.-r., Hsu, T.-s., Hsu, S.-c.: Indefinite sequence of moves in Chinese Chess endgames. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 264–279. Springer, Heidelberg (2002)Google Scholar
  4. 4.
    Fang, H.-r., Hsu, T.-s., Hsu, S.-c.: Checking indefinitely in Chinese-chess endgames. ICCA Journal 27(1), 19–37 (2004)Google Scholar
  5. 5.
    Heinz, E.A.: Knowledgeable encoding and querying of endgame databases. ICCA Journal 22(2), 81–97 (1999)Google Scholar
  6. 6.
    Romein, J.W., Bal, H.E.: Awari is solved. ICCA Journal 25(3), 162–165 (2002)Google Scholar
  7. 7.
    Thompson, K.: 6-piece endgames. ICCA Journal 19(4), 215–226 (1996)Google Scholar
  8. 8.
    van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: Now and in the future. Artificial Intelligence 134, 277–311 (2002)zbMATHCrossRefGoogle Scholar
  9. 9.
    Wu, R., Beal, D.F.: Fast, memory-efficient retrograde algorithms. ICCA Journal 24(3), 147–159 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Haw-ren Fang
    • 1
  1. 1.Department of Computer ScienceUniversity of MarylandUSA

Personalised recommendations