Learning to score final positions in the game of Go

DOI10.1016/J.TCS.2005.09.045MaRDI QIDQ817792zbMATH OpenOpenAlexFDO

Authors Erik C. D. van der Werf, H. J. van den Herik, Jos W. H. M. Uiterwijk

Publication date 20 March 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.09.045

zbMATH Keywords

learningscoringneural netgame recordsGolife and death

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1843056
• PAC-Bayesian pattern classification with kernels. Theory, algorithms, and an application to the game Go.
• Computer Go: An AI oriented survey
• A pattern classification approach to evaluation function learning
• Using patterns in computer Go

Cites work

• Computer Go
• Computer Go: An AI oriented survey
• GO Is Polynomial-Space Hard
• Learning to score final positions in the game of Go

Cited in

(5)

• PAC-Bayesian pattern classification with kernels. Theory, algorithms, and an application to the game Go.
• scientific article; zbMATH DE number 1843056 (Why is no real title available?)
• Learning to score final positions in the game of Go
• Static analysis based on formal models and incremental computation in Go programming
• scientific article; zbMATH DE number 6490910 (Why is no real title available?)

Describes a project that uses

Uses Software

• PRTools

This page was built for publication: Learning to score final positions in the game of Go

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