Alpha-beta Pruning
Alpha-Beta Pruning is an optimization algorithm in game tree search that reduces the number of nodes evaluated in the minimax algorithm by eliminating branches that cannot influence the final decision, thereby improving computational efficiency without affecting the outcome.
40
Publications
2.8K
Citations
62
Authors
34
Institutions
Publications per year
2017–2026
5
Parents
40
An analysis of alpha-beta pruning
Donald E. Knuth, Ronald W. Moore · Artificial Intelligence · 1975 · 1K citations
1–5 of 40
62
5
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 62
34

University of Alberta
Edmonton, Canada
4 h-index
10 publications
599 citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
5 publications
190 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
3 publications
149 citations
California Institute of Technology
Pasadena, United States
2 h-index
4 publications
72 citations
University of Oregon
Eugene, United States
2 h-index
2 publications
203 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
223 citations
Siemens (Austria)
Vienna, Austria
1 h-index
1 publications
36 citations

McGill University
Montreal, Canada
1 h-index
1 publications
45 citations
1–8 of 34
5 publications · 1.3K citations
5
h-index
Conference · 3 publications · 157 citations
3
h-index
TPAMI · 2 publications · 55 citations
2
h-index
Conference · 2 publications · 25 citations
2
h-index
2 publications · 54 citations
2
h-index
1–5