---
title: "Searching to Variable Depth in Computer Chess"
authors:
  - "Hermann Kaindl"
doi: ""
url: "https://ijcai.org/proceedings/1983/183"
pdf: "https://ijcai.org/proceedings/1983/0183.pdf"
venue: "Proceedings of the Eighth International Joint Conference on Artificial Intelligence"
year: 1983
pages: "760-761"
track: "Planning and Search"
keywords:
---

# Searching to Variable Depth in Computer Chess

Hermann Kaindl

*Proceedings of the Eighth International Joint Conference on Artificial Intelligence*, 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.