[1] 陳志昌(2005)。 電腦象棋知識庫系統之研製。
[2] 陳靖平、吳毅成(1999)。適用於六子棋應用的網格計算系統。
[3] 陳昱維、吳毅成(2011)。適用於電腦遊戲之志願型計算系統仲介者。
[4] 許舜欽, 曹國明 (1991)。電腦象棋開局知識庫系統之研製,台灣大學工程學刊,第五十三期,頁75─86。.[5] 鄒忻芸、吳毅成(2000)。CGDG桌機格網之應用層框架一般化與資源分配管理。
[6] 韓尚餘、吳毅成(2011)。適用於電腦對局遊戲之志願型計算系統工作端。
[7] Bruce Moreland's Programming Topics Site, available at http://brucemo.com/compchess/programming/index.htm
[8] J.P. Fishburn (1980). An optimization of alpha-beta search, SIGART Bulletin, Issue 72.
[9] J.P. Fishburn (1983). Another optimization of alpha-beta search, SIGART Bulletin, Issue 84.
[10] ICGA Tournaments, available at http://www.grappa.univ-lille3.fr/icga/
[11] International Computer Games Association, available at http://ilk.uvt.nl/icga/
[12] D.E. Knuth and R.W. Moore (1975). An analysis of alpha-beta pruning, Artificial Intelligence, 6:293–326.
[13] T. Marsland, A. Reinefeld, and J. Schaeffer (1987). Low Overhead Alternatives to SSS*. Artificial Intelligence, Vol. 31, No. 2, pp. 185-199. ISSN 0004-3702.
[14] J. von Neumann and O. Morgenstern (1944). Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ.
[15] A. Plaat, J. Schaeffer, W. Pijls, and A. de Bruin(1994). SSS* = a-b + TT. Technical Report TR-CS-94-17, Department of Computing Science, University of Alberta, Edmonton, AB, Canada.
[16] A. Plaat, J. Schaeffer, W. Pijls and A. de Bruin (1995). A Minimax Algorithm Better than Alpha-Beta? No and Yes. TR-95-15, Department of Computing Science, University of Alberta, Edmonton, AB, Canada.
[17] A. Plaat, J. Schaeffer, W. Pijls and A. de Bruin (1996). Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, Vol. 87, Nos. 1-2, pp. 255-293. ISSN 0004-3702.
[18] A. Plaat, J. Schaeffer, W. Pijls and A. de Bruin (1999). A Minimax Algorithm better than SSS*. Artificial Intelligence, Vol. 87, pp. 255–293. ISSN 0004-3702.
[19] J. Pearl (1980). Scout: A Simple Game-Searching Algorithm with Proven Optimal Properties. Proceedings of the First Annual National Conference on Artificial Intelligence, pp. 143-145.
[20] I. Roizen and J. Pearl (1983). A Minimax Algorithm Better than Alpha-Beta? Yes and No. Artificial Intelligence, Vol. 21, pp. 199-230.
[21] G.C. Stockman (1979). A minimax algorithm better than alpha-beta? Artificial Intelligence, 12(2):179–196.
[22] J.R. Slagle and J.K. Dixon (1969). Experiments with some programs that search game trees, JACM 16, 2 189-207.
[23] I.C. Wu, H.H. Lin, P.H. Lin, D.J. Sun, Y.C. Chan, B.T. Chen. (2010). Job-Level Proof Number Search For Connect6. Computers and Games.
[24] WIKIPEDIA, Chinese Chess, available at http://en.wikipedia.org/wiki/Chinese_Chess
[25] S.J. Yen, J. C. Chen, T. N. Yang and S.C. Hsu (2004). Computer Chinese Chess. ICGA Journal, Vol. 27, No. 1. pp. 3-18.