Chinese-chess rules for cyclic moves differ from Western-chess rules in two respects. First the outcome of a cyclic game can be a win, a loss, or a draw. Second, depending on the plies made inside a loop, there are up to 16 rules a player can violate when a loop occurs. However, the same rule has to be violated three times in a row, i.e., in three consecutive loops, in order to lose a game. Therefore, a player can violate different rules in three cycles and still achieve a draw. In contrast, Western-chess rules always define a game as a draw after three consecutive loops. This paper reports on an adequate implementation of the Chinese-chess rules used to decide the outcome of a game when it falls into loops. The rules are proposed by the Asia Chinese-Chess Association. © 2006 Springer-Verlag.
CITATION STYLE
Wu, K. C., Hsu, S. C., & Hsu, T. S. (2006). The graph-history interaction problem in Chinese chess. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4250 LNCS, pp. 165–179). https://doi.org/10.1007/11922155_13
Mendeley helps you to discover research relevant for your work.