Job-Level Algorithms for Connect6 Opening Position Analysis
檔案
本條目沒有附加檔案。
日期
2014-01-01
作者
類型
系所
期刊名稱
COMPUTER GAMES, CGW 2014
卷期與頁次
第 504 卷,頁 29–44
ISSN
1865-0929
ISBN
978-3-319-14923-3; 978-3-319-14922-6
語言
英文
摘要
This paper investigates job-level (JL) algorithms to analyze opening positions for Connect6. The opening position analysis is intended for opening book construction, which is not covered by this paper. In the past, JL proof-number search (JL-PNS) was successfully used to solve Connect6 positions. Using JL-PNS, many opening plays that lead to losses can be eliminated from consideration during the opening game. However, it is unclear how the information of unsolved positions can be exploited for opening book construction. For this issue, this paper first proposes four heuristic metrics when using JL-PNS to estimate move quality. This paper then proposes a JL upper confidence tree (JL-UCT) algorithm and some heuristic metrics, one of which is the number of nodes in each candidate move\'s subtree. In order to compare these metrics objectively, we proposed two kinds of measurement methods to analyze the suitability of these metrics when choosing best moves for a set of benchmark positions. The results show that for both metrics this node count heuristic metric for JL-UCT outperforms all the others, including the four for JL-PNS.
關鍵詞
Job-level computingopening book generationConnect6proof-number searchMonte-Carlo tree searchupper confidence bound所屬典藏
會議論文引用此條目
Wei, T.-H., Wu, I.-C., Liang, C.-C., Chiang, B.-T., Tseng, W.-J., Yen, S.-J., & Lee, C.-S. (2014). Job-Level Algorithms for Connect6 Opening Position Analysis. COMPUTER GAMES, CGW 2014, 504, 29–44. https://ir.lib.nycu.edu.tw/handle/11536/128467
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/128467