32 search results - page 4 / 7 » Combining Tactical Search and Monte-Carlo in the Game of Go |
112
click to vote
EUROGP
2010
Springer
15 years 4 months ago
2010
Springer
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
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...
ACG
2009
Springer
15 years 4 months ago
2009
Springer
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
AIPS
2009
14 years 10 months ago
2009
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
AAAI
2008
14 years 12 months ago
2008
The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. ...