The principal continuation and the killer heuristic

@inproceedings{Akl1977ThePC,
  title={The principal continuation and the killer heuristic},
  author={Selim G. Akl and Monty Newborn},
  booktitle={ACM '77},
  year={1977}
}
An algorithm is presented for obtaining the <italic>principal continuation</italic> in trees searched by two-person game playing programs based on the <italic>Alpha-Beta algorithm</italic>. Moves saved while determining the principal continuation are shown to be good candidates for killer moves when the <italic>killer heuristic</italic> supplements the Alpha-Beta search. 

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 68 CITATIONS, ESTIMATED 81% COVERAGE

Parallel Chess Searching and Bitboards

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Selective search in games of different complexity

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Scalable Search in Computer Chess

  • Computational Intelligence
  • 2000
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Enhanced Iterative-Deepening Search

  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1994
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Phoenix: A Self-Optimizing Chess Engine

  • 2015 International Conference on Computational Intelligence and Communication Networks (CICN)
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

1987
2019

CITATION STATISTICS

  • 4 Highly Influenced Citations