COMPUTER CHESS METHODS

Article prepared for the ENCYCLOPEDIAOF ARTIFICIAL INTELLIGENCE, S. Shapiro (editor), D. Eckroth (Managing Editor) to be published by John Wiley, 1987.

[1]  Helmut Horacek.  Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings , 1983, J. Int. Comput. Games Assoc..

[2]  Alan G. Bell.  How to program a computer to play legal chess , 1970 .

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

[4]  Larry R. Harris.  The Heuristic Search And The Game Of Chess - A Study Of Quiescene, Sacrifices, And Plan Oriented Play , 1975, IJCAI.

[5]  John Philip Fishburn.  Analysis of speedup in distributed algorithms , 1984 .

[6]  H. Berliner.  Computer chess , 1978, Nature.

[7]  H. Jaap van den Herik,et al.  The Construction of an Omniscient Endgame Data Base , 1985, J. Int. Comput. Games Assoc..

[8]  K. Thompson,et al.  BELLE: chess hardware , 1988 .

[9]  James R. Slagle.  Artificial intelligence : the heuristic programming approach , 1971 .

[10]  Peter W. Frey.  An introduction to computer chess , 1983 .

[11]  Abbreviations , 1971 .

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

[13]  Selim G. Akl,et al.  The principal continuation and the killer heuristic , 1977, ACM '77.

[14]  David N. L. Levy,et al.  Chess and Computers , 1976 .

[15]  A. Kotok.  A chess playing program for the IBM 7090 , 1988 .

[16]  M. Wells,et al.  Experiments in Chess , 1957, JACM.

[17]  Monty Newborn,et al.  A parallel search chess program , 1985, ACM '85.

[18]  A. G. Bell.  The machine plays chess , 1978 .

[19]  Jonathan Schaeffer,et al.  Experiments in Search and Knowledge , 1986, J. Int. Comput. Games Assoc..

[20]  Murray Campbell,et al.  Using Chunking to Solve Chess Pawn Endgames , 1984, Artif. Intell..

[21]  K. Thompson,et al.  COMPUTER CHESS STRENGTH , 1982 .

[22]  James J. Gillogly,et al.  The Technology Chess Program , 1972, Artif. Intell..

[23]  Peter W. Frey,et al.  Chess Skill in Man and Machine , 1984, Springer New York.

[24]  Ivan Bratko,et al.  THE BRATKO-KOPEC EXPERIMENT: A COMPARISON OF HUMAN AND COMPUTER PERFORMANCE IN CHESS , 1982 .

[25]  Jonathan Schaeffer,et al.  Information Acquisition in Minimal Window Search , 1985, IJCAI.

[26]  Murray Campbell,et al.  A Chess Program That Chunks , 1983, AAAI.

[27]  James John Gillogly,et al.  Performance analysis of the technology chess program. , 1978 .

[28]  A. Bernstein,et al.  A chess playing program for the IBM 704 , 1899, IRE-ACM-AIEE '58 (Western).

[29]  Hans J. Berliner,et al.  Some Necessary Conditions for a Master Chess Program , 1973, IJCAI.

[30]  John C. Hayes,et al.  The World Computer Chess Championship , 1976 .

[31]  Carl Ebeling,et al.  The design and implementation of a VLSI chess move generator , 1984, ISCA '84.

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

[33]  Allen Newell,et al.  Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[34]  Jonathan Schaeffer.  The History Heuristic , 1983, J. Int. Comput. Games Assoc..

[35]  A. G. Bell,et al.  Games playing with computers , 1972 .

[36]  Barry L. Nelson,et al.  Hash Tables in Cray Blitz , 1985, J. Int. Comput. Games Assoc..

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

[38]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .

[39]  R M Hyatt,et al.  Cray Blitz , 1986 .

[40]  Donald Michie.  Chess with Computers , 1980 .

[41]  P. Kent,et al.  Tree-searching and tree-pruning techniques , 1988 .

[42]  Stuart Cracraft.  Bitmap Move Generation in Chess , 1984, J. Int. Comput. Games Assoc..

[43]  M. A. Bramer,et al.  A model for the representation of pattern-knowledge for the endgame in chess , 1979 .

[44]  T. Anthony Marsland,et al.  Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.

[45]  Fred Popowich,et al.  Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[46]  Hans J. Berliner,et al.  Chess as problem solving: the development of a tactics analyzer. , 1975 .

[47]  Richard D. Greenblatt,et al.  CHEOPS: a chess-oriented processing system , 1979 .

[48]  Judea Pearl,et al.  Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..

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

[50]  Jacques Pitrat,et al.  A Chess Combination Program Which Uses Plans , 1977, Artif. Intell..

[51]  T. Anthony Marsland,et al.  Relative Efficiency of Alpha-Beta Implementations , 1983, IJCAI.

[52]  Jonathan Schaeffer,et al.  Multiprocessor tree-search experiments , 1986 .

[53]  Peter W. Frey,et al.  Creating a Chess Player , 1988 .

[54]  A. Elo.  The rating of chessplayers, past and present , 1978 .

[55]  Donald E. Knuth,et al.  An Analysis of Alpha-Beta Pruning , 1975, Artif. Intell..

[56]  Edward W. Kozdrowicki,et al.  COKO III: The Cooper-Kozdrowicki Chess Program , 1974, Int. J. Man Mach. Stud..

[57]  David J. Slate,et al.  Chess 4.5-The Northwestern University chess program , 1988 .