Graph History Interaction Problem in Computer Chinese Chess
Date Issued
2005
Date
2005
Author(s)
Wu, Kuang-che
DOI
zh-TW
Abstract
The importance of mastering Chinese chess rules to improve the skills of Computer Chinese chess players is recognized by experts. However, we are not aware of any published results of a full implementation of Chinese chess rules with reasonable performance degradation. This paper reposts such an implementation and proposes some heuristics to deal the cyclic rules during search. The Chinese chess rules used to decide the outcome of a game when it falls into loops are those proposed by the Asia Chinese Chess Association. The Chinese chess rules for cyclic moves differ from Western chess rules in two regards. First the outcome of a cyclic game can either be win, loss or draw. Second, the same type of rule has to be violated three times in a row to lose the game. In other words, a player can violate different rules in three cycles to achieve a draw. In comparison, Western chess rules define a cyclic game as a draw.
Subjects
搜尋圖歷史交互作用問題
電腦象棋
亞洲棋規
Graph History Interaction
Computer Chinese Chess
Asia Chinese Chess rule
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92922030-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):ef2cb1edb2b4c0b794568dc8c5db999b