Name
Abstract | ||
|---|---|---|
Retrograde analysis is widely applied to construct databases of deterministic, finite, two-player zero-sum games with perfect information. However, its application to Chinese chess is limited because of the special rules about indefinite move sequences.Problems caused by the most influential rule, checking indefinitely(3), were successfully solved in practical cases, with 50 selected endgame databases constructed in accord with this rule, where the 60-move rule was ignored. Other special rules were verified having much less impact on contaminating the databases via a rule-tolerant approach. For constructing complete endgame databases, we need rigorous algorithms. There are two rule sets in Chinese chess: the Asian rule set and the Chinese rule set. In this article, algorithms are successfully developed to build win-draw-loss endgame databases in accord with the Asian rule set. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.3233/ICG-2005-28204 | ICGA JOURNAL |
DocType | Volume | Issue |
Journal | 28 | 2 |
ISSN | Citations | PageRank |
1389-6911 | 0 | 0.34 |
References | Authors | |
3 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haw-ren Fang | 1 | 132 | 13.24 |