32 search results - page 3 / 7 » Combining Tactical Search and Monte-Carlo in the Game of Go |
TCIAIG
2010
13 years 4 months ago
2010
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
CG
2006
Springer
14 years 1 months ago
2006
Springer
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
ICGA
2007
13 years 9 months ago
2007
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
CG
2010
Springer
13 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...
CG
2008
Springer
13 years 11 months ago
2008
Springer
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...