The principal continuation and the killer heuristic

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.