@inproceedings{42d3063cbcfb411ea8b3ae4ebfca46a1,
title = "Time management for Monte-Carlo tree search applied to the game of Go",
abstract = "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.",
keywords = "Game of Go, Monte-Carlo tree search, Time management",
author = "Huang, {Shih Chieh} and Remi Coulom and Lin, {Shun Shii}",
year = "2010",
doi = "10.1109/TAAI.2010.78",
language = "English",
isbn = "9780769542539",
series = "Proceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010",
pages = "462--466",
booktitle = "Proceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010",
note = "2010 15th Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010 ; Conference date: 18-11-2010 Through 20-11-2010",
}