Learning to score final positions in the game of Go

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

H. J. van den Herik, Erik C. D. van der Werf, 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

scoringlearningneural netgame recordsGolife and death

Mathematics Subject Classification ID

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

Cites Work

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

Related Items (3)

Title not available (Why is that?) ⋮ 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)