Abstract
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.
This work was done when the first author was with Institute of Information Science, Academia Sinica, Taiwan.
To avoid the ambiguous usage of the term chess, we use Western chess and Chinese chess in this paper.
Acknowledgment
We thank anonymous referees for very helpful comments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
China Xiangqi Association. The Playing Rules of Chinese Chess. Shanghai Lexicon Publishing Company, 1999. In Chinese.
H. Bal and V. Allis. Parallel retrograde analysis on a distributed system. In Proceedings of the 1995 ACM/IEEE Supercomputing Conference, 1995.
E.A. Heinz. Endgame databases and efficient index schemes for chess. ICCA Journal, 22(1):22–32, 1999.
E.A. Heinz. Knowledgeable encoding and querying of endgame databases. ICCA Journal, 22(2):81–97, 1999.
L. Stiller. Some results from a massively parallel retrograde analysis. ICCA Journal, 14(3):91–93, 1991.
K. Thompson. Retrograde analysis of certain endgames. ICCA Journal, 9(3):131–139, 1986.
H.J. van den Herik, I.S. Herschberg, and N. Nakad. A six-men-endgame database: KRP(a2)KbBP(a3). ICCA Journal, 10(4):163–180, 1987.
C. Wirth and J. Nievergelt. Exhaustive and heuristic retrograde analysis of KPPKP endgame. ICCA Journal, 22(2):67–80, 1999.
R. Wu and D. Beal. Solve chinese chess endgames. In Proceedings of Joint Conference on Information Sciences, pages 970–973, Atlantic City, USA, February 2000.
R. Wu and D. Beal. Computer analysis of some chinese chess endgames. In Advances in Computer Chess, volume 9. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, Hr., Hsu, Ts., Hsu, Sc. (2001). Construction of Chinese Chess Endgame Databases by Retrograde Analysis. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-45579-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43080-3
Online ISBN: 978-3-540-45579-0
eBook Packages: Springer Book Archive