32 search results - page 5 / 7 » Combining Tactical Search and Monte-Carlo in the Game of Go |
106
click to vote
TCIAIG
2010
14 years 8 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...
116
click to vote
ICGA
2007
15 years 1 months ago
2007
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
120
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
CG
2000
Springer
15 years 5 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...
73
Voted
AAAI
2000
15 years 2 months ago
2000
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...