Leandro Soriano Marcolino Advisor : Hitoshi Matsubara Multi-Agent Monte Carlo Go
@inproceedings{Marcolino2011LeandroSM, title={Leandro Soriano Marcolino Advisor : Hitoshi Matsubara Multi-Agent Monte Carlo Go}, author={Leandro Soriano Marcolino and Hitoshi Matsubara and C. Go}, year={2011} }
Go is a strategic board game that is considered one of the greatest challenges for Arti cial Intelligence. Many algorithms have been proposed, trying to tackle this problem, but generally all of them generated players that could be easily defeated by a strong human opponent. UCT Monte Carlo Go is one of the most successful algorithms. The basic idea is to associate a tree search with pseudo-random simulations, used to evaluate the leaves. Nowadays, the literature is more focused on how to… CONTINUE READING
Figures and Tables from this paper
References
SHOWING 1-10 OF 57 REFERENCES
Mathematical games: the fantastic combinations of john conway's new solitaire game "life
- Computer Science
- 1970
- 1,397
- PDF
Computer go as a sum of local games: an application of combinatorial game theory
- Computer Science
- 1995
- 66
Parallel Monte-Carlo Tree Search with Simulation Servers
- Computer Science
- 2010 International Conference on Technologies and Applications of Artificial Intelligence
- 2010
- 32
Flocks, herds and schools: A distributed behavioral model
- Computer Science, Geography
- SIGGRAPH '87
- 1987
- 5,230
- PDF