Exploration exploitation in Go : UCT for Monte-Carlo Go

@inproceedings{Gelly2006ExplorationEI,
  title={Exploration exploitation in Go : UCT for Monte-Carlo Go},
  author={Sylvain Gelly and Yizao Wang},
  year={2006}
}
Algorithm UCB1 for multi-armed bandit problem has already been extended to Algorithm UCT which works for minimax tree search. We have developed a Monte-Carlo program, MoGo, which is the first computer Go program using UCT. We explain our modifications of UCT for Go application, among which efficient memory management, parametrization, ordering of non-visited nodes and parallelization. MoGo is now a top-level Computer-Go program on 9× 9 Go board. 
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 250 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 134 extracted citations

251 Citations

02040'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 251 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Cs

  • L. Kocsis
  • Szepesvri, and J. Willemson. Improved monte-carlo…
  • 2006

Monte carlo go

  • B. Bruegmann
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…