Mining Expert Play to Guide Monte Carlo Search in the Opening Moves of Go
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 801-806.
Abstract
We propose a method to guide a Monte Carlo 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.
@inproceedings{ijcai2015p118,
title = {Mining Expert Play to Guide Monte Carlo Search in the Opening Moves of Go},
author = {Steinmetz, Erik S. and Gini, Maria L.},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {801--806},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/118},
}
TY - CPAPER TI - Mining Expert Play to Guide Monte Carlo Search in the Opening Moves of Go AU - Steinmetz, Erik S. AU - Gini, Maria L. T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 801 EP - 806 UR - https://ijcai.org/proceedings/2015/118 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: