Searching for solutions in games and artificial intelligence

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

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

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

[4]  How to mate : applying proof-number search , 1994 .

[5]  J. Schaeffer,et al.  An analysis of the conspiracy numbers algorithm , 1994 .

[6]  Jos W. H. M. Uiterwijk,et al.  Proof-Number Search and Transpositions , 1994, J. Int. Comput. Games Assoc..

[7]  A. Reinefeld.  A Minimax Algorithm Faster than Alpha - Beta , 1994 .

[8]  J. Blair,et al.  Games with Imperfect Information , 1993 .

[9]  J. T. Tromp,et al.  Aspects of algorithms and complexity , 1993 .

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

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

[12]  P. J. Esrom.  Heuristic Programming in Artificial Intelligence 2 (The Second Computer Olympiad), edited by D.N.L. Levy and D.F. Beal Prentice-Hall, Hemel Hempstead, UK, 1990, 243 pp. (£35.00) , 1991, Robotica (Cambridge. Print).

[13]  H. J. van den Herik,et al.  Kunnen computers rechtspreken , 1991 .

[14]  Duane Szafron,et al.  REVIVING THE GAME OF CHECKERS , 1991 .

[15]  A. Reznitsky,et al.  Pioneer: A Chess Program Modelling a Chess Master's Mind , 1990, J. Int. Comput. Games Assoc..

[16]  H. J. van den Herik,et al.  A knowledge-based approach to connect-four: The game is over: White to move wins! , 1989 .

[17]  H. J. van den Herik,et al.  Champ meets Champ , 1989 .

[18]  Norbert L. Klingbeil,et al.  Search strategies for conspiracy numbers , 1989 .

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

[20]  Lewis Stiller,et al.  Parallel Analysis of Certain Endgames , 1989, J. Int. Comput. Games Assoc..

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

[22]  L. Victor Allis,et al.  A Knowledge-Based Approach of Connect-Four , 1988, J. Int. Comput. Games Assoc..

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

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

[25]  D. Hofstadter.  Metamagical Themas: Questing for the Essence of Mind and Pattern , 1985 .

[26]  R. Korf.  An Optimal Admissible Tree Search , 1985 .

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

[28]  Edward H. Shortliffe,et al.  Rule Based Expert Systems: The Mycin Experiments of the Stanford Heuristic Programming Project (The Addison-Wesley series in artificial intelligence) , 1984 .

[29]  Donald F. Beal.  Mixing Heuristic and Perfect Evaluations: Nested Minimax , 1984, J. Int. Comput. Games Assoc..

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

[31]  H. J. van den Herik,et al.  Computerschaak, schaakwereld en kunstmatige intelligentie , 1983 .

[32]  H. Pattee.  Gödel, Escher, Bach: An Eternal Golden Braid , 1983 .

[33]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[34]  Andrew J. Palay,et al.  The B* Tree Search Algorithm - New Results , 1982, Artif. Intell..

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

[36]  Donald Michie.  INFORMATION AND COMPLEXITY IN CHESS , 1982 .

[37]  Gorō Sakata,et al.  Five-In-A-Row (Renju) for Beginners to Advanced Players , 1981 .

[38]  Oren Patashnik.  Qubic: 4×4×4 Tic-Tac-Toe , 1980 .

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

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

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

[42]  Eugene Charniak,et al.  On the Use of Framed Knowledge in Language Comprehension , 1978, Artif. Intell..

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

[44]  D. Marr,et al.  Artificial Intelligence - A Personal View , 1976, Artif. Intell..

[45]  E. Shortliffe.  Mycin: computer-based medical consultations , 1976 .

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

[47]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[48]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

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

[50]  Elwyn R. Berlekamp,et al.  Program for Double-Dummy Bridge Problems—A New Strategy for Mechanical Game Playing , 1963, JACM.

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

[52]  J. Neumann,et al.  Theory of Games and Economic Behavior. , 1945 .