Non-Linear Monte-Carlo Search in Civilization II
This paper presents a new Monte-Carlo search algorithm for very large sequential decision-making problems. Our approach builds on the recent success of Monte-Carlo tree search algorithms, which estimate the value of states and actions from the mean outcome of random simulations. Instead of using a s...
Main Authors: | Branavan, Satchuthanan R. (Contributor), Silver, David (Author), Barzilay, Regina (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor) |
Format: | Article |
Language: | English |
Published: |
AAAI Press/International Joint Conferences on Artificial Intelligence,
2012-10-24T20:34:34Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Learning to win by reading manuals in a Monte-Carlo framework
by: Branavan, Satchuthanan R., et al.
Published: (2012) -
Reading Between the Lines: Learning to Map High-level Instructions to Commands
by: Branavan, Satchuthanan R., et al.
Published: (2011) -
Content Modeling Using Latent Permutations
by: Chen, Harr, et al.
Published: (2010) -
Global models of document structure using latent permutations
by: Chen, Harr, et al.
Published: (2010) -
Learning High-Level Planning from Text
by: Branavan, Satchuthanan R., et al.
Published: (2014)