All-Moves-As-First Heuristics in Monte-Carlo Go
@inproceedings{Helmbold2009AllMovesAsFirstHI, title={All-Moves-As-First Heuristics in Monte-Carlo Go}, author={D. Helmbold and Aleatha Parker-Wood}, booktitle={IC-AI}, year={2009} }
We present and explore the effectiveness of sev- eral variations on the All-Moves-As-First (AMAF) heuristic in Monte-Carlo Go. [...] Key Result Updates even more aggressive than AMAF can be even more beneficial.Expand Abstract
54 Citations
Learning non-random moves for playing Othello: Improving Monte Carlo Tree Search
- Computer Science
- 2011 IEEE Conference on Computational Intelligence and Games (CIG'11)
- 2011
- 19
- PDF
A Survey of Monte Carlo Tree Search Methods
- Computer Science
- IEEE Transactions on Computational Intelligence and AI in Games
- 2012
- 1,713
- PDF
On the Analysis of Complex Backup Strategies in Monte Carlo Tree Search
- Computer Science
- ICML
- 2016
- 10
- PDF
Reducing variance in MCTS using bootstrap method
- Computer Science
- 2018 Chinese Control And Decision Conference (CCDC)
- 2018
References
SHOWING 1-9 OF 9 REFERENCES
Library of effective go routines (libEGO)
- Library of effective go routines (libEGO)
- 2009
Independent study quarterly reports
- http://users.soe.ucsc.edu/ ̃charlie/projects/SlugGo/,
- 2008
Independent study quarterly reports. http://users.soe.ucsc.edu/Ëœcharlie/projects/SlugGo
- Independent study quarterly reports. http://users.soe.ucsc.edu/Ëœcharlie/projects/SlugGo
- 2008