Learning a Go heuristic with Tilde

DOI10.1007/3-540-45579-5_10MaRDI QIDQ4536686zbMATH OpenFDO

Authors Jan Ramon, Tom Francis, Hendrik Blockeel

Publication date 6 August 2002

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

Full work available at URL https://lirias.kuleuven.be/handle/123456789/133343

zbMATH Keywords

decision treesGoinductive logic programmingmachine learningTsume-Go

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) 2-person games (91A05) Experimental studies (91A90)

Recommendations

• Using patterns in computer Go
• Learning on graphs in the game of Go
• Computer Go: An AI oriented survey
• Lambda-search in game trees -- with application to Go
• HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO

Cited in

(3)

• All normalized anti-monotonic overlap graph measures are bounded
• Learning on graphs in the game of Go
• Using patterns in computer Go

This page was built for publication: Learning a Go heuristic with Tilde

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