Computer Go: An AI oriented survey

[1]  Martin Müller,et al.  Computer Go , 2002, Artif. Intell..

[2]  A. Waters.  Winning ways. , 2002, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[3]  Bruno Bouzy.  LES ENSEMBLES FLOUS AU JEU DE GO , 2002 .

[4]  Bruno Bouzy.  Incremental Updating of Objects in INDIGO , 2002 .

[5]  William L. Spight.  Extended Thermography for Multiple Kos in Go , 1998, Computers and Games.

[6]  Labo IA Saint-Denis.  GENERATION OF PATTERNS WITH EXTERNAL CONDITIONS FOR THE GAME OF GO , 2001 .

[7]  Tristan Cazenave,et al.  Automatic Acquisition of Tactical Go Rules , 2001 .

[8]  Tristan Cazenave.  Automatic Ordering of Predicates by Metarules , 2001 .

[9]  Keh-Hsun Chen.  Some Practical Techniques for Global Search in Go , 2000, J. Int. Comput. Games Assoc..

[10]  Thomas Wolf.  Forward Pruning and Other Heuristic Search Techniques in Tsume Go , 2000, Inf. Sci..

[11]  Kuo-Yuan Kao.  Mean and Temperature Search for Go Endgames , 2000, Inf. Sci..

[12]  Martin Müller.  Not Like Other Games -- Why Tree Search in Go is Different , 2000 .

[13]  J. Burmeister,et al.  Memory performance of master go players , 2000 .

[14]  Ken Chen,et al.  Static Analysis of Life and Death in the Game of Go , 1999, Inf. Sci..

[15]  Reijer Grimbergen.  A Plausible Move Generator for Shogi Using Static Evaluation , 1999 .

[16]  Bruno Bouzy.  Complex Games in Practice , 1999 .

[17]  Martin Müller.  Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames , 1999, IJCAI.

[18]  Tristan Cazenave,et al.  Metaprogramming Domain Specific Metaprograms , 1999, Reflection.

[19]  Richard J. Nowakowski,et al.  Games of No Chance 3: Surveys , 1998 .

[20]  Atsushi Yoshikawa,et al.  Relations between Skill and the Use of Terms - An Analysis of Protocols of the Game of Go , 1998, Computers and Games.

[21]  Martin Müller,et al.  Computer Go: A Research Agenda , 1998, Computers and Games.

[22]  Jonathan Schaeffer,et al.  Single-Agent Search in the Presence of Deadlocks , 1998, AAAI/IAAI.

[23]  Jacques Pitrat.  Games: The Next Challenge , 1998, J. Int. Comput. Games Assoc..

[24]  Tristan Cazenave,et al.  Metaprogramming Forced Moves , 1998, ECAI.

[25]  Atsushi Yoshikawa,et al.  The 3rd Fost-Cup World-Open Computer-Go Championship , 1997, J. Int. Comput. Games Assoc..

[26]  T. Cazenave,et al.  Development and Evaluation of Strategic Plans , 1997 .

[27]  Paul E. Lehner,et al.  Multipurpose Strategic Planning In the Game of Go , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  Patrick Ricaud.  A Model of Strategy for the Game of Go Using Abstraction Mechanisms , 1997, IJCAI.

[29]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

[30]  Jonathan Schaeffer,et al.  One jump ahead - challenging human supremacy in checkers , 1997, J. Int. Comput. Games Assoc..

[31]  Y. Saito.  The difference of knowledge for solving Tsume-Go problem according to the skill , 1997 .

[32]  K. Kao.  Sums of hot and tepid combinatorial games , 1997 .

[33]  Kazuhiro Ueda,et al.  An Evolutionary Algorithm Extended by Ecological Analogy and its Application to the Game of Go , 1997, IJCAI.

[34]  Shui Hu.  Multipurpose adversary planning in the game of go , 1996 .

[35]  H. Jaap van den Herik,et al.  GO‐MOKU SOLVED BY NEW SEARCH TECHNIQUES , 1996, Comput. Intell..

[36]  Tristan Cazenave.  Système d'apprentissage par auto-observation : Application au jeu de go , 1996 .

[37]  Ken Thompson,et al.  6-Piece Endgames , 1996, J. Int. Comput. Games Assoc..

[38]  L. Stiller.  Multilinear Algebra and Chess Endgames , 1996 .

[39]  Ralph Gasser,et al.  Experiments in Computer Go Endgames , 1996 .

[40]  Howard A. Landman,et al.  Eyespace Values in Go , 1996 .

[41]  B. Bouzy.  There are no winning moves except the last , 1996 .

[42]  Thomas Wolf,et al.  About Problems in Generalizing a Tsumego Program to Open Positions , 1996 .

[43]  M. Enzenberger.  The Integration of A Priori Knowledge into a Go Playing Neural Network , 1996 .

[44]  Gerald Tesauro,et al.  Temporal difference learning and TD-Gammon , 1995, CACM.

[45]  Bruno Bouzy.  Modelisation cognitive du joueur de go , 1995 .

[46]  P. Ricaud.  Gobelin une approche pragmatique de l'abstraction appliquee a la modelisation de la strategie elementaire du jeu de go , 1995 .

[47]  Martin Müller,et al.  Computer go as a sum of local games: an application of combinatorial game theory , 1995 .

[48]  H. Jaap van den Herik,et al.  Proof-Number Search , 1994, Artif. Intell..

[49]  Gerald Tesauro,et al.  TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play , 1994, Neural Computation.

[50]  Thomas Wolf.  The program GoTools and its computer-generated tsume go database , 1994 .

[51]  Elwyn R. Berlekamp,et al.  Mathematical Go endgames - nightmares for the professional Go player , 1994 .

[52]  L. V. Allis,et al.  Searching for solutions in games and artificial intelligence , 1994 .

[53]  Kazuhiro Ueda,et al.  A Case Study on Acquisition and Refinement of Deductive Rules based on EBG in an Adversary Game: how , 1994 .

[54]  LogicJonas BarklundBox.  Metaprogramming in Logic , 1994 .

[55]  Terrence J. Sejnowski,et al.  Temporal Difference Learning of Position Evaluation in the Game of Go , 1993, NIPS.

[56]  John P. Gallagher,et al.  Tutorial on specialisation of logic programs , 1993, PEPM '93.

[57]  John Nunn,et al.  Extracting Information from Endgame Databases , 1993, J. Int. Comput. Games Assoc..

[58]  Robert Lake,et al.  Solving Large Retrograde Analysis Problems Using a Network of Workstations , 1993 .

[59]  Jaap van den Herik,et al.  Heuristic programming in Artificial Intelligence 3: the third computer olympiad , 1992 .

[60]  John C. Shepherdson,et al.  Unfold/fold transformations of logic programs , 1992, Mathematical Structures in Computer Science.

[61]  Jonathan Schaeffer,et al.  A World Championship Caliber Checkers Program , 1992, Artif. Intell..

[62]  Herbert D. Enderton.  The Golem Go Program , 1991 .

[63]  Elwyn R. Berlekamp,et al.  Introductory overview of mathematical Go endgames , 1991 .

[64]  David N. L. Levy,et al.  Heuristic Programming in Artificial Intelligence , 1991, J. Int. Comput. Games Assoc..

[65]  F. Hsu,et al.  A Grandmaster Chess Machine , 1990 .

[66]  Donald F. Beal,et al.  A Generalised Quiescence Search Algorithm , 1990, Artif. Intell..

[67]  Jonathan Schaeffer,et al.  Conspiracy Numbers , 1990, Artif. Intell..

[68]  H. J. van den Herik,et al.  Which games will survive , 1990 .

[69]  Albert L. Zobrist,et al.  A New Hashing Method with Application for Game Playing , 1990 .

[70]  Oren Etzioni,et al.  Explanation-Based Learning: A Problem Solving Perspective , 1989, Artif. Intell..

[71]  Terrence J. Sejnowski,et al.  A Parallel Network that Learns to Play Backgammon , 1989, Artif. Intell..

[72]  Murray Campbell,et al.  Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..

[73]  Alan Bundy,et al.  Explanation-Based Generalisation = Partial Evaluation , 1988, Artif. Intell..

[74]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[75]  David A. McAllester.  Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[76]  R. Lathe.  Phd by thesis , 1988, Nature.

[77]  C. Sechen.  Simulated Annealing Algorithm , 2017 .

[78]  Ken Thompson,et al.  Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..

[79]  E. KorfRichard.  Depth-first iterative-deepening: an optimal admissible tree search , 1985 .

[80]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[81]  Steven Minton,et al.  Constraint-Based Generalization: Learning Game-Playing Plans From Single Examples , 1984, AAAI.

[82]  John Michael Robson,et al.  N by N Checkers is Exptime Complete , 1984, SIAM J. Comput..

[83]  K. A. Ericsson,et al.  Protocol Analysis: Verbal Reports as Data , 1984 .

[84]  T. Anthony Marsland,et al.  A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..

[85]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[86]  John Michael Robson,et al.  The Complexity of Go , 1983, IFIP Congress.

[87]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[88]  Aviezri S. Fraenkel,et al.  Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n , 1981, J. Comb. Theory, Ser. A.

[89]  Hans J. Berliner,et al.  Backgammon Computer Program Beats World Champion , 1980, Artif. Intell..

[90]  David Lichtenstein,et al.  GO Is Polynomial-Space Hard , 1980, JACM.

[91]  Jr. Kenneth Joseph Friedenbach.  Abstraction hierarchies: a model of perception and cognition in the game of go , 1980 .

[92]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[93]  Walter Reitman,et al.  The Structure and Performance of the INTERIM.2 Go Program , 1979, IJCAI.

[94]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[95]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[96]  R.K. Guy,et al.  On numbers and games , 1978, Proceedings of the IEEE.

[97]  Timothy D. Wilson,et al.  Telling more than we can know: Verbal reports on mental processes. , 1977 .

[98]  Judith S Reitman,et al.  Skilled perception in Go: Deducing memory structures from inter-response times , 1976, Cognitive Psychology.

[99]  Ch Chen,et al.  Pattern recognition and artificial intelligence , 1976 .

[100]  D. B. Benson,et al.  Life in the game of Go , 1976, Inf. Sci..

[101]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[102]  H. Simon,et al.  Perception in chess , 1973 .

[103]  William E. Walden,et al.  A computer assisted study of Go on M x N boards , 1972, Information Sciences.

[104]  Jonathan Leonard Ryder,et al.  Heuristic analysis of large trees as generated in the game of Go , 1971 .

[105]  A. V. Uskov,et al.  Programming a computer to play chess , 1970 .

[106]  Albert Lindsey Zobrist,et al.  Feature extraction and representation for pattern recognition and the game of go , 1970 .

[107]  Albert L. Zobrist,et al.  A model of visual organization for the game of GO , 1899, AFIPS '69 (Spring).

[108]  Donald E. Eastlake,et al.  The Greenblatt chess program , 1967, AFIPS '67 (Fall).

[109]  William E. Walden,et al.  A partial analysis of Go , 1964, Comput. J..

[110]  Horst Remus,et al.  Simulation of a Learning Machine for Playing GO , 1962, IFIP Congress.

[111]  G. M. Clemence,et al.  Blow up of smooth solutions to the barotropic compressible magnetohydrodynamic equations with finite mass and energy , 2008, 0811.4359.

[112]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[113]  E. Rowland.  Theory of Games and Economic Behavior , 1946, Nature.

[114]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.