The N-Relaxed Checking-Win Search Problem in Chinese Chess
Date Issued
2005
Date
2005
Author(s)
Tsai, Hsu-Cheng
DOI
zh-TW
Abstract
In Chinese chess game, the N-relaxed checking-win problem is to find a proof, in the form of an AND-OR graph, such that any path from the root to the terminal nodes consists of all but at most N non-checking moves for the root player. When a proof cannot be found, then a disproof is sought, This is complicated problem because a correct implementation must
deal with the Chinese chess rules which we are not aware of having any efficient implementation.
The problem becomes more difficult if a hash table is used
to store the previous searched result in order to improve performance.
In this paper, a correct solution with tolerable performance cost based on Graph History Interaction (GHI) proof search is presented. We have chosen to implement the Asia Chinese chess rules in our program.
Subjects
連將殺
停著殺
電腦象棋
N-relax checking-win
computer chinese chess
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92922012-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):9246768727969adf19b3e2cc6eba595e