Sciweavers

16 search results - page 1 / 4
» Monte-Carlo Tree Search: A New Framework for Game AI
Sort
View
AIIDE
2008
13 years 7 months ago
Monte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
Guillaume Chaslot, Sander Bakkes, Istvan Szita, Pi...
ACG
2009
Springer
13 years 11 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
ACL
2011
12 years 8 months ago
Learning to Win by Reading Manuals in a Monte-Carlo Framework
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
S. R. K. Branavan, David Silver, Regina Barzilay
AAAI
2010
13 years 6 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...