Computer Go

[1]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[2]  H. Jaap van den Herik,et al.  Games solved: Now and in the future , 2002, Artif. Intell..

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

[4]  Bill Spight.  Go Thermography: the 4/21/98 Jiang--Rui Endgame , 2002 .

[5]  Bruno Bouzy,et al.  Computer Go: An AI oriented survey , 2001, Artif. Intell..

[6]  Martin Müller.  Global and local game tree search , 2001, Inf. Sci..

[7]  Martin Müller,et al.  Partial order bounding: A new approach to evaluation in game tree search , 2001, Artif. Intell..

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

[9]  Terrence J. Sejnowski,et al.  Learning to evaluate Go positions via temporal difference methods , 2001 .

[10]  Reijer Grimbergen,et al.  Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi , 2000, Computers and Games.

[11]  Thomas Thomsen.  Lambda-Search in Game Trees - with Application to Go , 2000, Computers and Games.

[12]  Tristan Cazenave,et al.  Abstract Proof Search , 2000, Computers and Games.

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

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

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

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

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

[18]  Robert C. Holte,et al.  A Space-Time Tradeoff for Memory-Based Heuristics , 1999, AAAI/IAAI.

[19]  Jonathan Schaeffer,et al.  Pushing the limits: new developments in single-agent search , 1999 .

[20]  J. M. Burmeister,et al.  A1 techniques used in Computer Go , 1999 .

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

[22]  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.

[23]  Noriaki Sanechika,et al.  Estimating the Possible Omission Number for Groups in Go by the Number of n-th Dame , 1998, Computers and Games.

[24]  Alan Bundy,et al.  An Adversarial Planning Approach to Go , 1998, Computers and Games.

[25]  Move Evaluation Tree System , 1998 .

[26]  Takuya Kojima,et al.  Automatic Acquisition of Go Knowledge from Game Records: Deductive and Evolutionary Approaches , 1998 .

[27]  Ken Chen,et al.  Machine Learning, Game Play, and Go , 1998 .

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

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

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

[31]  Jonathan Schaeffer,et al.  Search Versus Knowledge in Game-Playing Programs Revisited , 1997, IJCAI.

[32]  Richard K. Belew,et al.  Coevolutionary search among adversaries , 1997 .

[33]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

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

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

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

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

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

[39]  David Wolfe.  The Gamesman's Toolkit , 1996 .

[40]  E. Berlekamp.  The Economist's View of Combinatorial Games , 1996 .

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

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

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

[44]  Michael Buro,et al.  ProbCut: An Effective Selective Extension of the α-β Algorithm , 1995, J. Int. Comput. Games Assoc..

[45]  Janet Wiles,et al.  The Integration of Cognitive Knowledge into Perceptual Representations in Computer Go , 1995 .

[46]  Michael Buro,et al.  ProbCut: An Effective Selective Extension of the alphabeta Algorithm , 1995 .

[47]  Elwyn R. Berlekamp,et al.  Mathematical Go - chilling gets the last point , 1994 .

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

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

[50]  David Moews,et al.  On Some Combinatorial Games Connected with Go , 1993 .

[51]  P. Gács,et al.  Algorithms , 1992 .

[52]  Stuart C. Shapiro,et al.  Encyclopedia of artificial intelligence, vols. 1 and 2 (2nd ed.) , 1992 .

[53]  Richard Bozulich,et al.  The Go player's almanac , 1992 .

[54]  Tony Marsland,et al.  COMPUTER CHESS AND SEARCH , 1992 .

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

[56]  Anders Kierulf,et al.  Smart Game Board: a workbench for game playing programs, with Go and Othello as case studies , 1990 .

[57]  Ken Chen,et al.  Smart game board and go explorer: a study in software and knowledge engineering , 1990, Commun. ACM.

[58]  D. Sandbach.  All systems go. , 1986, The Health service journal.

[59]  Bruce Wilcox,et al.  Reflections on building two Go programs , 1985, SGAR.

[60]  L. Yedwab.  ON PLAYING WELL IN A SUM OF GAMES , 1985 .

[61]  H. Robbins,et al.  Asymptotically efficient adaptive allocation rules , 1985 .

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

[63]  F. L. Morris.  Playing disjunctive sums is polynomial space complete , 1981 .

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

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

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

[67]  A. D. D. Groot.  Thought and Choice in Chess , 1978 .

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

[69]  Robert A. Nado,et al.  Goals and plans in a program for playing Go , 1974, ACM '74.

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

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

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

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

[74]  A. Walther,et al.  International federation of information processing news , 1962, CACM.

[75]  C. Raman.  The diamond , 1956 .