Computer Go: An AI oriented survey

Artificial Intelligence

Volumn 132, Issue 1, 2001, Pages 39-103

  Bouzy, Bruno ^a   Cazenave, Tristan ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

Artificial intelligence methods; Automatic knowledge acquisition; Cognitive science; Combinatorial game theory; Computer Go survey; Evaluation function; Heuristic search; Mathematical morphology; Monte Carlo methods

Indexed keywords

COGNITIVE SYSTEMS; COMBINATORIAL MATHEMATICS; FUNCTION EVALUATION; GAME THEORY; HEURISTIC PROGRAMMING; KNOWLEDGE ACQUISITION; LEARNING SYSTEMS; MATHEMATICAL MORPHOLOGY; MONTE CARLO METHODS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTER GAMES;

ARTIFICIAL INTELLIGENCE;

EID: 0035479281     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00127-8     Document Type: Article

References (151)

1. Proof-number search
2. Go-moku solved by new search techniques
3. Singular extensions: Adding selectivity to brute force searching
4. Metaprogramming in logic
5. A generalised quiescence search algorithm
6. Life in the game of Go
7. Introductory overview of mathematical Go endgames
8. The B* tree search algorithm: A best-first proof procedure
9. Backgammon computer program beats world champion
10. A pattern matcher for Goliath
11. Overzicht van de ontwikkeling van een Go spelend programma
12. Les ensembles flous au jeu de Go
13. The Indigo program
14. There are no winning moves except the last
15. Explicitation de connaissances non conscientes par modélisation computationnelle dans un domaine complexe: Le jeu de Go
16. Incremental updating of objects in Indigo
17. Complex games in practice
18. The use of inferential information in remembering Go positions
19. Memory performance of master Go players
20. A comparison of minimax tree search algorithms
21. Automatic ordering of predicates by metarules
22. Automatic acquisition of tactical Go rules
23. Development and evaluation of strategic plans
24. Metaprogramming forced moves
25. Metaprogramming domain specific metaprograms
26. Generation of patterns with external conditions for the game of Go
27. Perception in chess
28. Group identification in computer Go
29. The move decision process of Go intellect
30. Attack and defense
31. Static analysis of life and death in the game of Go
32. Some practical techniques for global search in Go
33. Pattern databases
34. Explanation based learning: An alternative view
35. The program G2
36. The 3rd FOST cup world-open computer-Go championship
37. Computing a perfect strategy for n by n Chess requires time exponential
38. Specialization of logic programs
39. The Greenblatt chess program
40. Artificial Intelligence or stochastic relaxation: Simulated annealing challenge
41. A plausible move generator for Shogi using static evaluation
42. Explanation based generalisation = Partial evaluation
43. Which games will survive?
44. Mathematical Go
45. Multipurpose strategic planning in the game of Go
46. A grandmaster chess machine
47. Single-agent search in the presence of deadlocks
48. The search algorithm of the Shogi program K3.0
49. Mean and temperature search for Go endgames
50. Optimisation by simulated annealing
51. An analysis of alpha-beta pruning
52. A case study on acquisition and refinement of deductive rules based on EBG in an adversary game: How to capture stones in Go
53. An evolutionary algorithm extended by ecological analogy and its application to the game of Go
54. Depth-first iterative deepening: An optimal admissible tree search
55. Finding optimal solutions to Rubik's Cube using pattern databases
56. Solving large retrograde-analysis problems using a network of workstations
57. Eyespace values in Go
58. Perception in Go as a problem in AI
59. Go is polynomial-space hard
60. Conspiracy numbers for min-max search
61. Constraint-based generalization learning game-playing plans from single examples
62. Explanation-based learning: A problem solving perspective
63. Quantitative results concerning the utility of explanation-based learning
64. Explanation-based generalization: A unifying view
65. Games theories and computer Go
66. Experiments in computer Go endgames
67. Computer Go: A research agenda
68. Decomposition search: A combinatorial games approach to game tree search, with applications to solving Go endgames
69. Race to capture: Analyzing Semeai in Go
70. Not like other games - Why tree search in Go is different
71. Telling more than we can know: Verbal reports on mental processes
72. Extracting information from endgame databases
73. Metagame: A new challenge from games and learning
74. A program for learning to play chess
75. Games: The next challenge
76. Skilled perception in Go: Deducing memory structures from inter-response times
77. The structure and performance of the INTERIM.2 Go program
78. Simulation of a learning machine for playing Go
79. A model of strategy for the game of Go using abstraction mechanisms
80. Do Go players think in words? Interim report of the analysis of Go players' protocol
81. An analysis of strong Go-players' protocols
82. Some studies in machine learning using the game of checkers
83. Some studies in machine learning using the game of checkers II
84. Conspiracy numbers
85. A world championship caliber checkers program
86. Temporal difference learning of position evaluation in the game of Go
87. Programming a computer to play chess
88. Extended thermography for multiple Kos in Go
89. Multilinear algebra and chess endgames
90. A minimax algorithm better than alpha-beta?
91. Learning to predict by the method of temporal differences
92. Unfold/fold transformations of logic programs
93. A parallel network that learns to play Backgammon
94. Practical issues in temporal difference learning
95. TD-Gammon, a self teaching backgammon program, achieves master-level play
96. Temporal difference learning and TD-Gammon
97. Retrograde analysis of certain endgames
98. 6-piece endgames
99. A partial analysis of Go
100. A computer assisted study of Go on M × N boards
101. Les connaissances non conscientes de l'homme au travail
102. Computer Go
103. The program GoTools and its computer-generated tsume-go database
104. About problems in generalizing a tsumego program to open positions
105. Forward pruning and other heuristic search techniques in tsume go
106. Half extension algorithm
107. YSS: About its datastructures and algorithm
108. The difference of the knowledge for solving Tsume-Go problem according to the skill
109. Relations between skill and the use of terms - An analysis of protocols of the game of Go
110. A model of visual organization for the game of Go