Learning on graphs in the game of Go

DOI10.1007/3-540-44668-0_49MaRDI QIDQ4783906zbMATH OpenFDO

Authors Thore Graepel, Mike Goutrié, Marco Krüger, Ralf Herbrich

Publication date 9 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2130/21300347

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Learning to score final positions in the game of Go
• PAC-Bayesian pattern classification with kernels. Theory, algorithms, and an application to the game Go.
• Formulations of patterns by a graph model for the game of Go
• Learning a Go heuristic with Tilde
• Computer Go: An AI oriented survey

Cited in

(6)

• A statistical foundation for machine learning, with application to Go- Moku
• Chess neighborhoods, function combination, and reinforcement learning
• Learning a Go heuristic with Tilde
• Formulations of patterns by a graph model for the game of Go
• PAC-Bayesian pattern classification with kernels. Theory, algorithms, and an application to the game Go.
• Learning to score final positions in the game of Go

This page was built for publication: Learning on graphs in the game of Go

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783906)