Computer Go: An AI oriented survey

DOI10.1016/S0004-3702(01)00127-8zbMath0983.68152WikidataQ56170533 ScholiaQ56170533MaRDI QIDQ5958709

No author found.

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Monte Carlo methodsheuristic searchmathematical morphologyevaluation functionartificial intelligence methodsautomatic knowledge acquisitioncognitive sciencecombinatorial game theorycomputer Go survey

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Game theory (91A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

LinUCB applied to Monte Carlo tree search ⋮ The Go polynomials of a graph. ⋮ Evolving small-board Go players using coevolutionary temporal difference learning with archives ⋮ Limited lookahead in imperfect-information games ⋮ HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO ⋮ THE SEPARATION GAME ⋮ Multi-armed bandits with episode context ⋮ PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH ⋮ Learning to score final positions in the game of Go

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Depth-first iterative-deepening: An optimal admissible tree search
• Conspiracy numbers for min-max search
• Explanation-based generalisation \(=\) partial evaluation
• A parallel network that learns to play backgammon
• A minimax algorithm better than alpha-beta?
• Computing a perfect strategy for nxn chess requires time exponential in n
• An analysis of alpha-beta pruning
• Proof-number search
• Extended thermography for multiple \(kos\) in Go
• Practical issues in temporal difference learning
• A comparison of minimax tree search algorithms
• A computer assisted study of Go on \(M \times N\) boards
• N by N Checkers is Exptime Complete
• GO Is Polynomial-Space Hard
• A partial analysis of Go
• Sokoban: Enhancing general single-agent search methods using domain knowledge

This page was built for publication: Computer Go: An AI oriented survey