Computer Go and Monte Carlo Tree Search: Opening Book and Parallel Solutions
2016-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Computer Go and Monte Carlo Tree Search: Opening Book and Parallel Solutions
Authors
Published Date
2016-05
Publisher
Type
Thesis or Dissertation
Abstract
This work examines two aspects of Monte Carlo Tree Search (MCTS), a recent invention in the field of artificial intelligence. We propose a method to guide a Monte Carlo Tree Search in the initial moves of the game of Go. Our method matches the current state of a Go board against clusters of board configurations that are derived from a large number of games played by experts. The main advantage of this method is that it does not require an exact match of the current board, and hence is effective for a longer sequence of moves compared to traditional opening books. We apply this method to two different open-source Go-playing programs. Our experiments show that this method, through its filtering or biasing the choice of a next move to a small subset of possible moves, improves play effectively in the initial moves of a game. We also conduct a study of the effectiveness of various kinds of parallelization of MCTS, and add our own parallel MCTS variant. This variant introduces the notion of using multiple algorithms in the root version of parallelization. The study is conducted across two different domains: Go and Hex. Our study uses a consistent measure of performance gains in terms of winning rates against a fixed opponent and uses enough trials to provide statistically significant results.
Description
University of Minnesota Ph.D. dissertation. May 2016. Major: Computer Science. Advisor: Maria Gini. 1 computer file (PDF); ix, 97 pages.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Steinmetz, Erik. (2016). Computer Go and Monte Carlo Tree Search: Opening Book and Parallel Solutions. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/181668.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.