Skip to main content
Communities & Collections
All of DSpace
Statistics
English
العربية
বাংলা
Català
Čeština
Deutsch
Ελληνικά
Español
Suomi
Français
Gàidhlig
हिंदी
Magyar
Italiano
Қазақ
Latviešu
Nederlands
Polski
Português
Português do Brasil
Srpski (lat)
Српски
Svenska
Türkçe
Yкраї́нська
Tiếng Việt
Log In
Log in
New user? Click here to register.
Have you forgotten your password?
Home
理學院
資訊工程學系
學位論文
學位論文
Permanent URI for this collection
http://rportal.lib.ntnu.edu.tw/handle/20.500.12235/73912
Browse
Search
By Issue Date
By Author
By Title
By Subject
By Subject Category
Search
By Issue Date
By Author
By Title
By Subject
By Subject Category
1 results
Back to results
Filters
Author
search.filters.author.Chieh-Chun Chan
1
search.filters.author.詹傑淳
Subject
1
search.filters.subject.Computer Go
1
search.filters.subject.Damage Ko
1
search.filters.subject.Ko
1
search.filters.subject.Ko Fight
1
search.filters.subject.Ko Threat
Show more
Search subject
Submit
Browse subject tree
Date
Start
End
Submit
2010
1
Has files
No
Reset filters
Settings
Sort By
Accessioned Date Descending
Most Relevant
Title Ascending
Date Issued Descending
Results per page
1
5
10
20
40
60
80
100
Search
Author: search.filters.author.Chieh-Chun Chan
×
Has files: No
×
Search Tools
Search Results
Now showing
1 - 1 of 1
No Thumbnail Available
Item
電腦圍棋打劫的最佳策略之研究
(
2010
)
詹傑淳
;
Chieh-Chun Chan
Show more
打劫問題在圍棋裏佔據了一個十分重要的位置。在過去圍棋的打劫問題研究上,由於雙方各種走法的組合過於繁複,因此並未能考慮到所有可能獲得更大利益的情況。本論文重新的探討在本劫的條件下圍棋的打劫策略。首先,我們在打劫過程中將所有可能發生的情況都納入考慮,來確保不會有可能獲得更大利益的情況被忽略,利用MiniMax的搜尋原則建構出打劫的流程圖。接下來利用bottom up的方法來比較雙方的利益差,將不可能走到的分支砍掉,來找到正確決策的判斷式,因此我們可以得到在不同劫爭價值、有價值棋步、雙方劫材下最佳的決策。
Show more