Computer Go

DOI10.1016/S0004-3702(01)00121-7zbMath0982.68120MaRDI QIDQ5958205

No author found.

Publication date: 3 March 2002

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

zbMATH Keywords

knowledge representationgame tree searchComputer GoGo programs

Mathematics Subject Classification ID

2-person games (91A05) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

On the number of go positions on lattice graphs ⋮ Spatial state-action features for general games ⋮ Temporal-difference search in Computer Go ⋮ The Go polynomials of a graph. ⋮ Reward is enough ⋮ Frequency Distribution of Contextual Patterns in the Game of Go ⋮ THE SEPARATION GAME ⋮ Learning to score final positions in the game of Go

Cites Work

• Playing disjunctive sums is polynomial space complete
• Extended thermography for multiple \(kos\) in Go
• Applying adversarial planning techniques to Go
• Global and local game tree search
• A computer assisted study of Go on \(M \times N\) boards
• GO Is Polynomial-Space Hard
• A partial analysis of Go
• Partial order bounding: A new approach to evaluation in game tree search
• 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

This page was built for publication: Computer Go