Computer Go
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1759698
- Computer Go: An AI oriented survey
- scientific article; zbMATH DE number 3928370
- Advances in computer games. Many games, many challenges. Proceedings of the ICGA / IFIP SG16, 10th advances in computer games conference (ACG 10), November 24--27, 2003, Graz, Styria, Austria
- Using patterns in computer Go
Cites work
- A computer assisted study of Go on \(M \times N\) boards
- A partial analysis of Go
- Applying adversarial planning techniques to Go
- Extended thermography for multiple kos in Go
- Global and local game tree search
- GO Is Polynomial-Space Hard
- scientific article; zbMATH DE number 988825 (Why is no real title available?)
- scientific article; zbMATH DE number 988833 (Why is no real title available?)
- scientific article; zbMATH DE number 988844 (Why is no real title available?)
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 46977 (Why is no real title available?)
- scientific article; zbMATH DE number 50193 (Why is no real title available?)
- scientific article; zbMATH DE number 193097 (Why is no real title available?)
- scientific article; zbMATH DE number 193098 (Why is no real title available?)
- scientific article; zbMATH DE number 598464 (Why is no real title available?)
- scientific article; zbMATH DE number 1944392 (Why is no real title available?)
- scientific article; zbMATH DE number 1759692 (Why is no real title available?)
- scientific article; zbMATH DE number 1879188 (Why is no real title available?)
- Partial order bounding: A new approach to evaluation in game tree search
- Playing disjunctive sums is polynomial space complete
Cited in
(20)- Advances in computer games. Many games, many challenges. Proceedings of the ICGA / IFIP SG16, 10th advances in computer games conference (ACG 10), November 24--27, 2003, Graz, Styria, Austria
- The Go polynomials of a graph.
- Applying adversarial planning techniques to Go
- Computer-aided Go: Chess as a role model
- Reward is enough
- On the number of go positions on lattice graphs
- The integration of practical search and heuristic knowledge into a competitive Go-playing program
- Frequency Distribution of Contextual Patterns in the Game of Go
- scientific article; zbMATH DE number 3928370 (Why is no real title available?)
- scientific article; zbMATH DE number 48544 (Why is no real title available?)
- Temporal-difference search in Computer Go
- scientific article; zbMATH DE number 1759698 (Why is no real title available?)
- Remarks on history and presence of game tree search and research
- Using patterns in computer Go
- THE SEPARATION GAME
- World-championship-caliber Scrabble*
- Computer Go: An AI oriented survey
- Spatial state-action features for general games
- Artificial intelligence for games
- Learning to score final positions in the game of Go
This page was built for publication: Computer Go
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958205)