112 search results - page 3 / 23 » Searching Game Trees in Parallel Using SSS |
69
Voted
CG
2010
Springer
14 years 7 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
IJCAI
1989
14 years 11 months ago
1989
AAAI
2010
14 years 11 months ago
2010
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 ...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
CG
2006
Springer
14 years 11 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...