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. |
Year | DOI | Venue |
---|---|---|
1977 | 10.1145/800179.810240 | ACM Annual Conference |
Keywords | Field | DocType |
two-person game,alpha-beta search,alpha-beta algorithm,killer heuristic supplement,i introduction,principal continuation,good candidate,killer move,multi processing | Killer heuristic,Computer science,Continuation,Multiprocessing,Artificial intelligence,Game playing | Conference |
Citations | PageRank | References |
47 | 4.91 | 5 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Selim G. Akl | 1 | 2074 | 299.32 |
Monroe M. Newborn | 2 | 177 | 47.49 |