Bayesian pattern ranking for move prediction in the game of Go
暂无分享,去创建一个
[1] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[2] Albert L. Zobrist,et al. A New Hashing Method with Application for Game Playing , 1990 .
[3] Tristan Cazenave,et al. Automatic Acquisition of Tactical Go Rules , 2001 .
[4] Labo IA Saint-Denis. GENERATION OF PATTERNS WITH EXTERNAL CONDITIONS FOR THE GAME OF GO , 2001 .
[5] Bruno Bouzy,et al. Computer Go: An AI oriented survey , 2001, Artif. Intell..
[6] Tom Minka,et al. A family of algorithms for approximate Bayesian inference , 2001 .
[7] Michael I. Jordan,et al. Graphical models: Probabilistic inference , 2002 .
[8] Martin Müller,et al. Computer Go , 2002, Artif. Intell..
[9] Eric O. Postma,et al. Local Move Prediction in Go , 2002, Computers and Games.
[10] Thore Graepel,et al. Modelling Uncertainty in the Game of Go , 2004, NIPS.
[11] Bruno Bouzy,et al. Bayesian Generation and Integration of K-nearest-neighbor Patterns for 19x19 Go , 2005, CIG.