Sciweavers

5 search results - page 1 / 1
» Computing "Elo Ratings" of Move Patterns in the Ga...
Sort
View
ICGA
2007
157views Optimization» more  ICGA 2007»
13 years 4 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
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...
Rémi Coulom
ICML
2006
IEEE
14 years 5 months ago
Bayesian pattern ranking for move prediction in the game of Go
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...
David H. Stern, Ralf Herbrich, Thore Graepel
CIG
2005
IEEE
13 years 10 months ago
Bayesian Generation and Integration of K-nearest-neighbor Patterns for 19x19 Go
Abstract- This paper describes the generation and utilisation of a pattern database for 19x19 go with the Knearest-neighbor representation. Patterns are generated by browsing recor...
Bruno Bouzy, Guillaume Chaslot
FLAIRS
2003
13 years 6 months ago
Learning Opening Strategy in the Game of Go
In this paper, we present an experimental methodology and results for a machine learning approach to learning opening strategy in the game of Go, a game for which the best compute...
Timothy Huang, Graeme Connell, Bryan McQuade
ACG
2009
Springer
13 years 11 months ago
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search
Abstract. We present a new exploration term, more efficient than classical UCT-like exploration terms. It combines efficiently expert rules, patterns extracted from datasets, All-M...
Guillaume Chaslot, Christophe Fiter, Jean-Baptiste...