頁籤選單縮合
| 題 名 | 棋串攻防搜尋中不進子的辨識與處理方法=Identifying Squeeze-Forbidden Conditions and Processing Them in Block-Capturing Search |
|---|---|
| 作 者 | 嚴礽麒; 劉邦鋒; 許舜欽; | 書刊名 | 國立臺灣大學工程學刊 |
| 卷 期 | 90 2004.02[民93.02] |
| 頁 次 | 頁109-118 |
| 專 輯 | 資訊工程專輯 |
| 分類號 | 312.2、312.2 |
| 關鍵詞 | 棋串攻防; 不進子; 電腦圍棋; 緊氣; Computer go; Block-capturing; Squeeze-forbidden; Squeezing-liberty; |
| 語 文 | 中文(Chinese) |
| 中文摘要 | 在人工智慧的領域中,電腦圍棋一直是相當引人注目的課題。圍棋的規則簡單但變化繁複,而且具有不少自相矛盾的例外,所以很難進行歸納。如果設計電腦圍棋的人棋力不夠高強,則他所歸納的原則與演算法將會漏洞百出。在電腦圍棋程式設計中,棋串攻防搜尋是非常重要的一個環節。本篇論文主旨是探討一個在棋串攻防搜尋中常發生的情況,稱之為不進子,意思是當我方想對敵方棋串緊氣時,卻發生緊氣的棋子立刻先被敵方提取的情形。這種情況有時必須先做特別處理才能緊氣,但有時候這種故意送子給敵方吃的著手卻是妙著。如何對之作一個正確而快速的辨識,因而大大提升棋串攻防搜尋的效率,在本論文中將有詳盡的探討。 |
| 英文摘要 | Computer Go is still a noticeable subject in the field of artificial intelligence. Go has very simple rules, but it will create enormous unpredictable results. It is difficult to classify these results into principles because there are many exceptions in them. If the designer of computer Go has no higher rank of playing Go, he will make poor principles and algorithms because there are many flaws in them. In design of computer Go, block-capturing search plays a very important role. This paper explores one kind of condition called squeeze-forbidden, which usually occurs in block- capturing search. “Squeeze-forbidden” means that when we want to attack opponent’s block and play a squeezing- liberty move, the opponent will capture this move at once. When squeeze-forbidden occurs, we usually have to do something special to avoid this condition. But at some times the squeezing-liberty move (permit opponent to capture it) is a good and smart move. It is very important to identify these two kinds of conditions correctly and rapidly because it will get higher performance in block-capturing search. So in this paper, we will explore and analyze about that carefully. |
本系統中英文摘要資訊取自各篇刊載內容。