Computer Chess Miscellany

  • David Levy
  • Monroe Newborn


A number of people are interested in problems of the “White to play and mate in two” variety. Although these problems are not really part of chess (since the positions are normally quite artificial) the same techniques that are used in chess programming could easily be employed to solve problems. In fact the Northwestern program has, for some time, announced mate whenever it detected a forced mate within its horizon. A program could be made to find all mates within a certain number of moves simply by performing an exhaustive search to the required depth, and for this reason such a program would be, in my opinion, of little value. (But that is because I dislike both chess problems and exhaustive searches). Some of the microprocessor machines described above already solve such problems.


Opening Innovation Exhaustive Search Require Depth Forced Mate Chess Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. *.
    A game is drawn if fifty successive moves are played by each side without a pawn being moved or a capture being madeGoogle Scholar

Copyright information

© Computer Science Press, Inc. 1982

Authors and Affiliations

  • David Levy
  • Monroe Newborn

There are no affiliations available

Personalised recommendations