Retrograde analysis is well-known and has been successfully developed in the design ofWestern chess1 endgame databases. However, there is little achievement using this technique in the construction of Chinese chess endgame databases. Although the two types of chess have the same number of pieces, similar individual characteristics for pieces, and comparable scales of the size of the boards, the fundamental differences in their playing rules lead to different construction schemes and results of endgame databases.
In this paper, we describe our approach to the construction of Chinese Chess Endgame Databases when only one of the players possesses attacking piece(s). We show the results we have in constructing and analyzing a set of 151 endgame databases with a total of at most two attacking pieces, four defending pieces and two Kings. Our databases can be used by Chinese chess computer playing systems and computer aided Chinese chess training systems.
[1]
Henri E. Bal,et al.
Parallel Retrograde Analysis on a Distributed System
,
1995
.
[2]
Jürg Nievergelt,et al.
Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame
,
1999,
J. Int. Comput. Games Assoc..
[3]
H. Jaap van den Herik,et al.
A Six-Men-Endgame Database: KRP(a2)KbBP(a3)
,
1987,
J. Int. Comput. Games Assoc..
[4]
Ken Thompson,et al.
Retrograde Analysis of Certain Endgames
,
1986,
J. Int. Comput. Games Assoc..
[5]
Lewis Stiller.
Some Results from a Massively Parallel Retrograde Analysis
,
1991,
J. Int. Comput. Games Assoc..
[6]
Ernst A. Heinz,et al.
Endgame Databases and Efficient Index Schemes for Chess
,
1999,
J. Int. Comput. Games Assoc..
[7]
Ernst A. Heinz.
Knowledgeable Encoding and Querying of Endgame Databases
,
1999,
J. Int. Comput. Games Assoc..