The Heuristic Search And The Game Of Chess - A Study Of Quiescene, Sacrifices, And Plan Oriented Play
Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Search Techniques. Pages 334-338.
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 quies~ence, sacrifices, and plan oriented play.
@inproceedings{ijcai1975p51,
title = {The Heuristic Search And The Game Of Chess - A Study Of Quiescene, Sacrifices, And Plan Oriented Play},
author = {Harris, Larry R.},
booktitle = {Proceedings of the Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-75}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Patrick Winston and Carl Hewitt},
pages = {334--338},
year = {1975},
note = {Search Techniques},
url = {https://ijcai.org/proceedings/1975/51},
}
TY - CPAPER TI - The Heuristic Search And The Game Of Chess - A Study Of Quiescene, Sacrifices, And Plan Oriented Play AU - Harris, Larry R. T2 - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75 PB - International Joint Conferences on Artificial Intelligence PY - 1975 SP - 334 EP - 338 UR - https://ijcai.org/proceedings/1975/51 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
