Monte-Carlo Tree Search

@inproceedings{Winands2019MonteCarloTS,
  title={Monte-Carlo Tree Search},
  author={Mark H. M. Winands},
  booktitle={Encyclopedia of Computer Graphics and Games},
  year={2019}
}
  • M. Winands
  • Published in
    Encyclopedia of Computer…
    2019
  • Medicine
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features… 
1 Citations
Monte Carlo Tree Search as an intelligent search tool in structural design problems
TLDR
This work shows how MCTS can be adapted to search for suitable solutions of a structural engineering design problem, and reports the results obtained by applying both a plain and a hybrid version of single-agent M CTS.

References

SHOWING 1-10 OF 227 REFERENCES
AI techniques for the game of Go
TLDR
The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.
Monte Carlo strategies in scientific computing
TLDR
This book provides a self-contained and up-to-date treatment of the Monte Carlo method and develops a common framework under which various Monte Carlo techniques can be "standardized" and compared.
Monte Carlo Strategies in Scientific Computing
TLDR
The strength of this book is in bringing together advanced Monte Carlo methods developed in many disciplines, including the Ising model, molecular structure simulation, bioinformatics, target tracking, hypothesis testing for astronomical observations, Bayesian inference of multilevel models, missing-data problems.
Proceedings of the 24th international conference on Machine learning
This volume contains the papers accepted to the 24th International Conference on Machine Learning (ICML 2007), which was held at Oregon State University in Corvalis, Oregon, from June 20th to 24th,
A Survey of Monte Carlo Tree Search Methods
TLDR
A survey of the literature to date of Monte Carlo tree search, intended to provide a snapshot of the state of the art after the first five years of MCTS research, outlines the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarizes the results from the key game and nongame domains.
Associating Shallow and Selective Global Tree Search with Monte Carlo for 9*9 Go
  • B. Bouzy
  • Computer Science
    Computers and Games
  • 2004
TLDR
This exploration is based on Olga and Indigo, two experimental Monte-Carlo programs and provides a min-max algorithm that iteratively deepens the tree until one move at the root is proved to be superior to the other ones.
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
TLDR
A new framework to combine tree search with Monte-Carlo evaluation, that does not separate between a min-max phase and a Monte- carlo phase is presented, that provides finegrained control of the tree growth, at the level of individual simulations, and allows efficient selectivity.
SOME ASPECTS OF THE SEQUENTIAL DESIGN OF EXPERIMENTS
1. Introduction. Until recently, statistical theory has been restricted to the design and analysis of sampling experiments in which the size and composition of the samples are completely determined
Progressive Strategies for Monte-Carlo Tree Search
TLDR
Two progressive strategies for MCTS are introduced, called progressive bias and progressive unpruning, which enable the use of relatively time-expensive heuristic knowledge without speed reduction.
...
1
2
3
4
5
...