{"type":"ScholarlyArticle","title":"Searching to Variable Depth in Computer Chess","authors":[{"name":"Hermann Kaindl","slug":"hermann-kaindl","given":"Hermann","family":"Kaindl","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1983/183","pdf":"https://ijcai.org/proceedings/1983/0183.pdf","markdown":"https://ijcai.org/proceedings/1983/183.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/183","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":183,"pages":{"first":760,"last":761},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}