1Newborn M. Recent progress in computer chess[J]. Advances in Computer, 1978, 18:59-117.
2Don F Beal. A generalised quiescence search algorithm, department if computer science, queen mary college[J]. London University, Artificial Intelligence, 1990,43: 85-98.
3Ed Schroder. How rebel plays chess [EB/OL]. http://membets. home. nl/matador/chess840.htm, 2002.
4Chrilly Donninger, Null move and deep search:selective-search heuristics for obtuse chess programs[J]. ICCA Journal, 1993,16(3):137-143.
5Zobrist A. A new hashing method with application for game playing[R]. Computer Science Department, University of Wisconsin, Madison, 1970.
6Wu R, Beal D F. A memory efficient retrograde algorithm and its application to Chinese chess cndgames[J]. More Games of No Chance MSRI Publications, 2002,42 :207-228.
7Yen S J, Chen J C, Yang T N. Computer Chinese chess[J]. ICGA Journal, September 2005, 28(3):182-184.
8Chen S H. Design and implementation of a practical endgame database for Chinese chess[D]. Department of Computer Science and Information Engineering, National Taiwan University,Taiwan, 1998.
9Fang H R, Hsu T S, Hsu S C. Indefinite sequence of moves in Chinese chess endgames[C]. In:Proceedings of the Third International Conference on Computers and Games, 2002:264-279.
