The N-Relaxed Checking-Win Search Problem in Chinese Chess
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 93 === 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 foun...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/32105237366031625637 |