Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Chou, C. W., Teytaud, O., & Yen, S. J. (2011). Revisiting Monte-Carlo tree search on a normal form game: NoGo. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6624 LNCS, pp. 73–82). https://doi.org/10.1007/978-3-642-20525-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
