Revisiting Monte-Carlo tree search on a normal form game: NoGo

Authors:
C.-W. Chou;O. Teytaud;S.-J. Yen
Affiliations:
CSIE, NDHU, Houlian, Taiwan;TAO, Inria, LRI, UMR, Cnrs, Univ. Paris-Sud;CSIE, NDHU, Houlian, Taiwan
Venue:
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Year:
2011

Citing 12
Cited 1

Alternation

Journal of the ACM (JACM)
Computer Go: an AI oriented survey

Artificial Intelligence
Using confidence bounds for exploitation-exploration trade-offs

The Journal of Machine Learning Research
Valgrind: a framework for heavyweight dynamic binary instrumentation

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Combining online and offline knowledge in UCT

Proceedings of the 24th international conference on Machine learning
Knowledge Generation for Improving Simulations in UCT for General Game Playing

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Bandit-based optimization on graphs with application to library performance tuning

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Monte-Carlo exploration for deterministic planning

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient selectivity and backup operators in Monte-Carlo tree search

CG'06 Proceedings of the 5th international conference on Computers and games
Scalability and parallelization of Monte-Carlo tree search

CG'10 Proceedings of the 7th international conference on Computers and games
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning
Creating an upper-confidence-tree program for havannah

ACG'09 Proceedings of the 12th international conference on Advances in Computer Games

Genetic fuzzy markup language for game of NoGo

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We revisitMonte-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.