The Heuristic Search and The Game of Chess. A Study of Quiescence, Sacrifices, and Plan Oriented Play

  • Larry Harris


This paper describes the results of applying the formal heuristic search algorithm to the game of chess, and the impact of this work on the theory of heuristic search. It is not that the application of the heuristic search can by itself solve the problems at the heart of computer chess, but that representing these problems within the formalism of the heuristic search will further their common solution. A separate search heuristic is proposed that does offer a common solution to the problem of quiescence, sacrifices, and plan-oriented play.


Heuristic Search Search Tree Travelling Salesman Problem Attack Path Brute Force Approach 
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.

Copyright information

© David Levy 1988

Authors and Affiliations

  • Larry Harris

There are no affiliations available

Personalised recommendations