打劫在圍棋裏佔據了十分重要的位置，然而目前大部分的電腦圍棋程式都不具備打劫的能力。我們利用最大最小搜尋法的原則，得出本劫最佳的打劫策略，使得電腦圍棋程式在處理本劫時，能在局部求得獲利最大或損失最小的下法。我們根據形勢判斷的定義，精確的定義了棋步、劫爭與劫材的價值，作為探討打劫策略的基礎。我們也詳細探討了打劫過程中劫材的使用策略。

Ko plays a very important role in Go, but most computer Go programs still cannot handle ko fight so far. Utilizing the principle of the minimax search, we obtain some best strategies for the simple one-point ko situation, enabling computer Go programs to gain maximum or loss minimum profit when dealing with the simple one-point ko situation. In order to achieve our goal, we define the value of a move, the value of a ko and the value of a ko threat precisely as the foundation of our discussion. We also dicuss in detail the strategies for using ko threats during the process of the ko fight.

[1]中國圍棋史話,http://shy.taiwango.org/article/china_go/china_go.htm
[2]日本近代圍棋通史,http://shy.taiwango.org/article/history/history.htm
[3]台灣棋院文化基金會, http://taiwango.org.tw/
[4]D. Lefkovitz,”A strategic pattern recognition program for the game of Go”,University of
Pennsylvania, the Moore school of Electrical Engineering, Wright Air Development Division,
Technical note 60-243,1-92, 1960.
[5]Zobrist, A. L,”A Model of Visual Organization for the Game of Go”, Proc. AFIPS 1969
Spring Joint Computer Conf. 34 (Boston, Mass., May 14-16, 1969), 103-112. AFIPS Press,
Montvale, NJ, 1969.
[6]顏士淨,”電腦圍棋程式Jimmy 5.0之設計與製作”,國立台灣大學資訊工程研究所,博士論
文,1999.
[7]S.C. Hsu, J.C. Yan, and H. Chang.”Design and implementation of a computer Go program
Archimage 1.1”. Journal of Information Science and Engineering 10, pages 239--258, 1994.
[8]Allis, V.,”Searching for solutions in games and artificial intelligence”. phD thesis, University
of Limburg, Maastricht, 1994.
[9] Lichtenstein. D.and Sipser. M.,”GO is Polynomial-Space Hard”, Journal ACM 27, 2 (April
1980), 393-401. (Also: IEEE Symp. on Foundations of Computer Science, (1978), 48-54).
[10]Mick Resis，http://www.reiss.demon.co.uk/webgo/compgo.htm.
[11]陳志行,http://www.wulu.com/.
[12]Elwyn Berlekamp, and YoungHoan Kim.”Where is the Thousand-Dollar ko?”.Games of No
Chance, MSRI Publications Volume 29,1996.
[13]John H. Conway.”On Numbers and Games”. Adademic Press, London/New York,1976.
[14]村島誼紀,《劫爭辭典》,理藝出版社,1997.
[15]林海峰,《打劫之魔力》,理藝出版社,1997.
[16]大竹英雄,《官子入門》,世界文物出版社.
[17] L. Yedwab,”On playing well in a sum of games” Master's thesis, MIT, 1985.
MIT/LCS/TR-348.
[18]吳震坤,”電腦詰棋程式中處理劫爭問題之研究” ,國立台灣大學資訊工程研究所,碩士論
文,2001.
[19]Thomas Wolf,”Forward pruning and other heuristic search techniques in tsume go”,
Information sciences, 122, 2000, pp.59-76
[20]K. Chen,”Computer Go-Knowledge, Search, and Move decision”, to appear.
[21]應昌期圍棋教育基金會,《計點制圍棋規則》,1995年版.
[22]日本棋院,《日本圍棋規則》,1989.
[23]李昌鎬,《我的形勢判斷》,理藝出版社,2001.