2008 IEEE Symposium on Computational Intelligence and Games 2008
DOI: 10.1109/cig.2008.5035639
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of Monte Carlo tree search and the application to Go

Abstract: Abstract-Recent improvements to Monte Carlo tree search have produced strong computer Go programs. This paper presents a method of measuring the accuracy of Monte Carlo tree search in game programming. We use the win percentage of positions in a large database of game records as a benchmark and compare the win probability obtained by simulations with the benchmark. By applying our method to Monte Carlo tree search in Go, we found differences between search methods and their parameters, and the effect of the pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…Takeuchi et al [210], [211] use the relationship between the win probability obtained from playouts with actual games to calculate evaluation curves, which allow the comparison of different search methods, search parameters, and search performance at different stages of the game. These measurements promise to improve performance in Go and other MCTS applications.…”
Section: Future Work On Gomentioning
confidence: 99%
See 2 more Smart Citations
“…Takeuchi et al [210], [211] use the relationship between the win probability obtained from playouts with actual games to calculate evaluation curves, which allow the comparison of different search methods, search parameters, and search performance at different stages of the game. These measurements promise to improve performance in Go and other MCTS applications.…”
Section: Future Work On Gomentioning
confidence: 99%
“…Takeuchi et al [210], [211] compare the win probabilities obtained for various search methods, including UCT, to those observed in actual games, to evaluate the effectiveness of each search method for Othello. Othello remains an open challenge for future MCTS research.…”
Section: P-gamementioning
confidence: 99%
See 1 more Smart Citation
“…The research findings indicated that while there were some similarities, AlphaZero did not replicate human history entirely, exhibiting distinct characteristics in opening choices and move diversity. [4,5].…”
Section: The Revolution Of Neural Network and The Era Of Diverse Ches...mentioning
confidence: 99%