Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo

@inproceedings{Chou2011RevisitingMT,
  title={Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo},
  author={Cheng-Wei Chou and Olivier Teytaud and Shi-Jim Yen},
  booktitle={EvoApplications},
  year={2011}
}
We revisit Monte-Carlo Tree Search on a recent game, termed NoGo. Our goal is to check if known results in Computer-Go and various other games are general enough for being applied directly on a new game. We also test if the known limitations of Monte-Carlo Tree Search also hold in this case and which improvements of Monte-Carlo Tree Search are necessary for good performance and which have a minor effect. We also tested a generic Monte-Carlo simulator, designed for “no more moves” games. 
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
20 Citations
22 References
Similar Papers

Citations

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

Similar Papers

Loading similar papers…