23 search results - page 2 / 5 » Monte-Carlo Proof-Number Search for Computer Go |
TCIAIG
2010
13 years 2 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 ...
CIG
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
CG
2010
Springer
13 years 5 months ago
2010
Springer
Monte Carlo Tree Search has given computer go a significant boost in strength the past few years, but progress seems to have slowed, and once again we have to ask ourselves how can...
ACG
2003
Springer
14 years 1 months ago
2003
Springer
We describe two Go programs, ¢¡¤£¦¥ and ¢¡¤§¨£ , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abra...
ICGA
2008
13 years 8 months ago
2008
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....