Deep Blue

[1]  Dap Hartmann,et al.  BEHIND DEEP BLUE , 2003 .

[2]  Feng-Hsiung Hsu,et al.  Behind Deep Blue: Building the Computer that Defeated the World Chess Champion , 2002 .

[3]  Deniz Yuret,et al.  Alpha-Beta-Conspiracy Search , 2002, J. Int. Comput. Games Assoc..

[4]  Gerald Tesauro,et al.  Comparison training of chess evaluation functions , 2001 .

[5]  Ernst A. Heinz,et al.  Scalable Search in Computer Chess , 2000, Computational Intelligence.

[6]  Ernst A. Heinz.  Scalable search in computer chess: algorithmic enhancements and experiments at high search depths , 1999 .

[7]  Murray Campbell,et al.  Knowledge discovery in deep blue , 1999, Commun. ACM.

[8]  Feng-Hsiung Hsu,et al.  IBM's Deep Blue Chess grandmaster chips , 1999, IEEE Micro.

[9]  W. Gropp,et al.  Using MPI-2nd Edition , 1999 .

[10]  Andreas Junghanns,et al.  Are there Practical Alternatives to Alpha-Beta? , 1998, J. Int. Comput. Games Assoc..

[11]  Andreas Junghanns,et al.  Are There Practical Alternatives To Alpha-Beta in Computer Chess? , 1998 .

[12]  Monty Newborn,et al.  Kasparov versus Deep Blue - computer chess comes of age , 1996 .

[13]  Mark G. Brockington,et al.  A Taxonomy of Parallel Game-Tree Search Algorithms , 1996, J. Int. Comput. Games Assoc..

[14]  Rainer Feldmaus,et al.  Spielbaumsuche mit massiv parallelen Systemen , 1993 .

[15]  Romeo Çollaku,et al.  Deep thought , 1991, Nature.

[16]  Thomas S. Anantharaman,et al.  Extension Heuristics , 1991, J. Int. Comput. Games Assoc..

[17]  Jonathan Schaeffer,et al.  Computers, Chess, and Cognition , 2011, Springer New York.

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

[19]  Murray Campbell,et al.  Experiments with the Null-Move Heuristic , 1990 .

[20]  Feng-hsiung Hsu.  Large scale parallelization of alpha-beta search: an algorithmic and architectural study , 1989 .

[21]  David N. L. Levy,et al.  The Sex Algorithm in Computer Chess , 1989, J. Int. Comput. Games Assoc..

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

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

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

[25]  Gerald Tesauro,et al.  Connectionist Learning of Expert Preferences by Comparison Training , 1988, NIPS.

[26]  Feng-hsiung Hsu,et al.  A two-million moves/sec CMOS single chip chess move generator , 1987, 1987 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

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

[28]  Alexander Reinefeld,et al.  An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..

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

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