The Design and Implementation for the Middle Game of Computer Chinese Deep Elephant

• Main Author: 黃文樟
• Other Authors: 林順喜、許順欽
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/56265353025582145020

國立臺灣師範大學 === 資訊工程研究所 === 94 === Computer chess is always deeply concerned in the field of artificial intelligence. Computer Chinese chess is most possibly the next game to defeat the top human player after DeepBlue defeated the best human chess player Kasparov. Many researchers started studying computer Chinese chess since the complexity of Chinese chess is a little higher than that of chess and both the data structure and search algorithms are similar with each other. This thesis introduces the basic data structures, search algorithms, and evaluation function of computer Chinese chess “Deep Elephant” (won the bronze medal of 11th Computer Olympiad hold in Turin, Italy) and gives the experimental results and analyses of the data structures and search algorithms it used. Finally, we propose some improvements aimed at the evaluation function－the core of strengthening the ability of the program. Keywords : artificial intelligence, computer Chinese chess, search algorithm, evaluation function.