Skip to main content
Conference ProceedingsOPEN ACCESS

The principal continuation and the killer heuristic

Proceedings of the 1977 Annual Conference, ACM 1977 (1977) 466-473
DOI: 10.1145/800179.810240
64Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

An algorithm is presented for obtaining the principal continuation in trees searched by two person game playing programs based on the Alpha- Beta algorithm. Moves saved while determining the principal continuation are shown to be good candidates for killer moves when the killer heuristic supplements the Alpha-Beta search.

Cite

CITATION STYLE

APA

Akl, S. G., & Newborn, M. M. (1977). The principal continuation and the killer heuristic. In Proceedings of the 1977 Annual Conference, ACM 1977 (pp. 466–473). Association for Computing Machinery, Inc. https://doi.org/10.1145/800179.810240

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free