Using patterns in computer Go

DOI10.1007/978-3-319-19941-2_54MaRDI QIDQ5114624zbMATH OpenOpenAlexFDO

Authors Leszek Stanisław Śliwa

Publication date 24 June 2020

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

Full work available at URL https://doi.org/10.1007/978-3-319-19941-2_54

zbMATH Keywords

artificial intelligencecomputer GoheuristicsMCTSpatterns

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational methods for problems pertaining to game theory, economics, and finance (91-08) 2-person games (91A05) Combinatorial games (91A46)

Recommendations

• A Fast Indexing Method for Monte-Carlo Go
• Computer Go: An AI oriented survey
• Computer Go
• scientific article; zbMATH DE number 1759681
• HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO

Cited in

(9)

• Computer chess move-ordering schemes using move influence
• A Fast Indexing Method for Monte-Carlo Go
• scientific article; zbMATH DE number 1759681 (Why is no real title available?)
• Formulations of patterns by a graph model for the game of Go
• HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO
• CONNECTIVITY IN THE GAME OF GO
• AI 2005: Advances in Artificial Intelligence
• Computer Go
• Learning to score final positions in the game of Go

This page was built for publication: Using patterns in computer Go

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