9 search results - page 1 / 2 » Lambda-Search in Game Trees - with Application to Go |
CG
2000
Springer
13 years 8 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
GAMEON
2001
13 years 5 months ago
2001
This paper investigates the application of neural network techniques to the creation of a program that can play the game of Go with some degree of success. The combination of soft...
TCIAIG
2010
12 years 11 months ago
2010
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
ICML
2006
IEEE
14 years 5 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...
ECAI
1998
Springer
13 years 8 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...