The heuristic search and the game of chess a study of quiescence, sacrifices, and plan oriented play

Authors:
Larry R. Harris
Affiliations:
Department of Mathematics, Dartmouth College, Hanover, New Hampshire
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 5
Cited 0

Chess as problem solving: the development of a tactics analyzer.

Chess as problem solving: the development of a tactics analyzer.
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
The Greenblatt chess program

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Some necessary conditions for a master chess program

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the results of applying the formal heurisitic 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 the 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 problems of quiescence, sacrifices, and plan oriented play.