Time management for Monte-Carlo tree search in Go

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

The dominant approach for programs playing the game of Go is nowadays Monte-Carlo Tree Search (MCTS). While MCTS allows for fine-grained time control, little has been published on time management for MCTS programs under tournament conditions. This paper investigates the effects that various time-management strategies have on the playing strength in Go. We consider strategies taken from the literature as well as newly proposed and improved ones. We investigate both semi-dynamic strategies that decide about time allocation for each search before it is started, and dynamic strategies that influence the duration of each move search while it is already running. In our experiments, two domain-independent enhanced strategies, EARLY-C and CLOSE-N, are tested; each of them provides a significant improvement over the state of the art. 2012 Springer-Verlag.
Original languageEnglish
Title of host publicationAdvances in Computer Games
Pages39-51
Number of pages13
DOIs
Publication statusPublished - 2012

Publication series

SeriesLecture Notes in Computer Science
Volume7168

Cite this

Baier, H., & Winands, M. H. M. (2012). Time management for Monte-Carlo tree search in Go. In Advances in Computer Games (pp. 39-51). Lecture Notes in Computer Science, Vol.. 7168 https://doi.org/10.1007/978-3-642-31866-5_4