Learning to score final positions in the game of Go

DOI10.1016/J.TCS.2005.09.045zbMATH Open1086.68597OpenAlexW2159370375MaRDI QIDQ817792FDOQ817792

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

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

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)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Static analysis based on formal models and incremental computation in Go programming

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)