Time management for Monte-Carlo tree search applied to the game of Go

Shih Chieh Huang*, Remi Coulom, Shun Shii Lin

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

8 引文 斯高帕斯(Scopus)

摘要

Monte-Carlo tree search (MCTS) is a new technique that has produced a huge leap forward in the strength of Go-playing programs. An interesting aspect of MCTS that has been rarely studied in the past is the problem of time management. This paper presents the effect on playing strength of a variety of time-management heuristics for 19 × 19 Go. Results indicate that clever time management can have a very significant effect on playing strength. Experiments demonstrate that the most basic algorithm for sudden-death time controls (dividing the remaining time by a constant) produces a winning rate of 43.2±2.2% against GNU Go 3.8 Level 2, whereas our most efficient time-allocation strategy can reach a winning rate of 60±2.2% without pondering and 67.4±2.1% with pondering.

原文英語
主出版物標題Proceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010
頁面462-466
頁數5
DOIs
出版狀態已發佈 - 2010 十二月 1
事件2010 15th Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010 - Hsinchu, 臺灣
持續時間: 2010 十一月 182010 十一月 20

出版系列

名字Proceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010

其他

其他2010 15th Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010
國家/地區臺灣
城市Hsinchu
期間2010/11/182010/11/20

ASJC Scopus subject areas

  • 人工智慧
  • 計算機理論與數學

指紋

深入研究「Time management for Monte-Carlo tree search applied to the game of Go」主題。共同形成了獨特的指紋。

引用此