Solving Chinese chess endgames by database construction

This paper describes an improved retrograde algorithm used for work on cons tructing Chinese chess endgame databases. Significant differences from data bases for (western) chess are examined, and their influence on database con struction noted. Results from Chinese chess yield surprises for human Chine se chess experts, overturning previous human analysis over many years by to p players. The aegp-aaee ending is a theoretical win, and not as previously believed, a draw. We also consider the computational resources required to perform these computations. (C) 2001 Published by Elsevier Science Inc.