Job-Level UCT Search for Solving Hex
檔案
本條目沒有附加檔案。
日期
2015
類型
系所
期刊名稱
2015 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG)
卷期與頁次
頁 222–229
ISSN
2325-4270
ISBN
978-1-4799-8622-4
語言
英文
摘要
Recently, Pawlewicz and Hayward successfully solved many Hex openings based on the Scalable Parallel Depth-First Proof-Number Search algorithm (SPDFPN), which was performed in a single machine with multiple threads. However, further parallelization is limited by the number of cores a single machine can possess. This paper investigates adapting this SPDFPN solver to a distributed computing environment, using the previously proposed job-level upper-confidence tree algorithm (JL-UCT) in order to further increase parallelism. To improve on the adapted JL-UCT solver system, we make a new attempt to support transposition information sharing among jobs in JL implementations. A mix of shared-memory and database techniques was used to achieve this improvement. Our experiments show that the adapted JL-UCT solver scales for larger problems. Additionally, using a single machine with 24 cores, the adapted method is able to solve Hex openings with less time than the previous SPDFPN solver in three of four test cases. Overall, for the four test cases, the adapted JL-UCT solver, using 6 nodes each with 24 cores, obtained speedups of 1.6, 1.9, 1.8 and 2.6 over those for the SPDFPN solver using one node with 24 cores.
所屬典藏
會議論文引用此條目
Liang, X., Wei, T., & Wu, I.-C. (2015). Job-Level UCT Search for Solving Hex. 2015 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 222–229. https://ir.lib.nycu.edu.tw/handle/11536/135513
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/135513