Computer Chess Compendium

  • Editors
  • David┬áLevy

Table of contents

  1. Front Matter
    Pages i-x
  2. Introduction

    1. Front Matter
      Pages 1-1
    2. Claude E. Shannon
      Pages 2-13
    3. Alan M. Turing
      Pages 14-17
  3. Famous Chess Programs

    1. Front Matter
      Pages 28-28
    2. Allen Newell, Cliff Shaw, Herbert Simon
      Pages 29-42
    3. Alex Bernstein, Michael de V. Roberts
      Pages 43-47
    4. Richard D. Greenblatt, Donald E. Eastlake III, Stephen D. Crocker
      Pages 56-66
    5. James J. Gillogly
      Pages 67-79
    6. David Slate, Larry Atkin
      Pages 80-103
    7. Robert A. Hyatt, Albert E. Gower, Harry L. Nelson
      Pages 104-111
  4. Position Evaluation

    1. Front Matter
      Pages 112-112
  5. Tree Searching Techniques

    1. Front Matter
      Pages 122-122
    2. John Birmingham, Peter Kent
      Pages 123-128
    3. Grigori M. Adelson-Velskiy, Vladimir L. Arlazarov, Mikhail V. Donskoy
      Pages 129-135
  6. Analysis

    1. Front Matter
      Pages 156-156
    2. Adriaan de Groot
      Pages 157-174
    3. Herbert Simon, William Chase
      Pages 175-188
    4. Mikhail Botvinnik
      Pages 189-195
    5. George Baylor, Herbert Simon
      Pages 196-212
    6. D. Prinz
      Pages 213-219
  7. Writing a Chess Program

    1. Front Matter
      Pages 220-220
    2. Norman Whaland
      Pages 221-232
    3. David Wilkins
      Pages 233-257
    4. John Birmingham, Peter Kent
      Pages 258-265
  8. Special Purpose Software and Hardware

    1. Front Matter
      Pages 266-266
    2. Mike Clarke
      Pages 267-272
    3. Henri Vigneron
      Pages 273-278
    4. J. Moussouris, J. Holloway, R. Greenblatt
      Pages 279-285
    5. Joe Condon, Ken Thompson
      Pages 286-292
  9. The Endgame

    1. Front Matter
      Pages 293-294
    2. Jaap van den Herick
      Pages 316-329
    3. V. Arlazarov, A. Futer
      Pages 330-336
  10. Games Played by Chess Programs

  11. Back Matter
    Pages 421-440

About this book


For many years I have been interested in computer chess and have collected almost every learned paper and article on the subject that I could find. My files are now quite large, and a considerable amount of time, effort and expense has been required to build up this collection. I have often thought how difficult it must be for many computer chess enthusiasts to acquire copies of articles that they see referenced in some other work. Unless one has access to a good reference library, the task is almost impossible. I therefore decided to try to make available, in one volume, as many as possible of the most interesting and important articles and papers ever written on the subject. Such a selection is naturally somewhat subjective, and I hope that I will not offend authors whose works have been excluded. In particular I have decided to exclude any material which has appeared in the Journal of the International Computer Chess Association (ICCA), or in its precursor, the ICCA Newsletter. The reason is simply that the ICCA itself is in the process of compiling a compendium containing the most important material published in those sources. For further information on ICCA membership and publications the reader is invited to contact: Professor H. 1. van den Herik, or Dr Jonathan Schaeffer University of Limburg, Computing Science Dcpaitment, Department of Computer Science University of Alberta, 6200 MD Maastricht Edmonton Netherlands Alberta, Canada T6G 2HI.


Processing chess complexity computer computer science control controlling programming robot technology time

Bibliographic information