Indefinite sequence of moves in Chinese chess endgames

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. However, in Chinese chess, there are special rules other than checkmate and stalemate to end a game. Therefore, some terminal positions cannot be determined by the typical retrograde analysis algorithm. If these special rules are ignored in the construction of the endgame databases, the resulting databases may contain incorrect information. In this paper, we not only describe our approach in abstracting the special rules of Chinese chess and its consequent problems when retrograde analysis is applied, but also give a solution to construct complete endgame databases complying with the most important special rules. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Fang, H. R., Hsu, T. S., & Hsu, S. C. (2003). Indefinite sequence of moves in Chinese chess endgames. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2883, 264–279. https://doi.org/10.1007/978-3-540-40031-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free