電腦圍棋打劫的策略

The Strategies for Ko Fight of Computer Go

黃士傑

指導教授 ： 林順喜

國立臺灣師範大學/理學院/資訊工程研究所/碩士(2002年)

摘要

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

關鍵字

電腦圍棋 ； 打劫 ； 劫材 ； 最大最小搜尋法

並列摘要

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.

並列關鍵字

Computer Go ； Ko ； Ko Threat ； Minimax Search

參考文獻

[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

[8]Allis, V.,”Searching for solutions in games and artificial intelligence”. phD thesis, University