Indefinite Sequence of Moves in Chinese Chess Endgames

In western chess, retrograde analysis has been successfully applied to construct 6-piece endgame databases. This classical algorithm first determines all terminal win or loss positions, i.e., those that are either checkmate or stalemate, and then propagates the values back to their predecessors until no further propagation is possible. The un-propagated positions are then declared draws.

[1]  Ren Wu,et al.  Fast, Memory-efficient Retrograde Algorithms , 2001, J. Int. Comput. Games Assoc..

[2]  H. Jaap van den Herik,et al.  Games solved: Now and in the future , 2002, Artif. Intell..

[3]  Ken Thompson,et al.  6-Piece Endgames , 1996, J. Int. Comput. Games Assoc..

[4]  Ernst A. Heinz.  Knowledgeable Encoding and Querying of Endgame Databases , 1999, J. Int. Comput. Games Assoc..

[5]  Tsan-sheng Hsu,et al.  Construction of Chinese Chess Endgame Databases by Retrograde Analysis , 2000, Computers and Games.