21 search results - page 1 / 5 » Learning to Score Final Positions in the Game of Go |
ACG
2003
Springer
13 years 10 months ago
2003
Springer
NIPS
1993
13 years 6 months ago
1993
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
CG
2010
Springer
13 years 3 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
AAI
2010
13 years 2 months ago
2010
Here, we present a constrained object recognition task that has been robustly solved largely with simple machine learning methods, using a small corpus of about 100 images taken u...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
We investigate the problem of learning to predict moves in the board game of Go from game records of expert players. In particular, we obtain a probability distribution over legal...