Searching to Variable Depth in Computer Chess

Kaindl, Hermann

Searching to Variable Depth in Computer Chess

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 760-761.

Abstract

This paper discusses some methods for guiding thesearch of conven tional chess programs to variable depth. The motivation for investigating such methods comes from the fact that sea r ching t o a fixed depth causes difficul t problems (e.g. the horizon effect). The first section deals with cer tain improvements of the quiescence search and a demonstration of their beneficial effects. The method of not coun ting moves as a ply of depth is investigated then and the results of extending it somewhat are reported. As thi s method seems to be too sim-ple nevertheless, a more general model for extending the hori zon of the full-width search to variable depth is proposed.

Hermann Kaindl. 1983. Searching to Variable Depth in Computer Chess. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 760–761. https://ijcai.org/proceedings/1983/183

@inproceedings{ijcai1983p183,
  title     = {Searching to Variable Depth in Computer Chess},
  author    = {Kaindl, Hermann},
  booktitle = {Proceedings of the Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-83}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Alan Bundy},
  pages     = {760--761},
  year      = {1983},
  note      = {Planning and Search},
  url       = {https://ijcai.org/proceedings/1983/183},
}

TY  - CPAPER
TI  - Searching to Variable Depth in Computer Chess
AU  - Kaindl, Hermann
T2  - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1983
SP  - 760
EP  - 761
UR  - https://ijcai.org/proceedings/1983/183
ER  -