Keyword

alpha-beta pruning

Description: Alpha-beta pruning is a search optimization technique that reduces the game-tree nodes evaluated by the minimax algorithm in adversarial decision-making.

Primary topic: Artificial Intelligence in Games (82%)

Wikidata ID: wiki/Q570496

OpenAlex ID: keywords/alpha-beta-pruning

An analysis of alpha-beta pruning

1975 · Donald E. Knuth, Ronald W. Moore · Artificial Intelligence · 1,005

Real-time heuristic search

1990 · Richard E. Korf · Artificial Intelligence · 924

Why Functional Programming Matters

1989 · J. Hughes · The Computer Journal · 735

Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress

1967 · A. L. Samuel · IBM Journal of Research and Development · 695

Probabilistic Boolean decision trees and the complexity of evaluating game trees

1986 · Michael Saks, Avi Wigderson · Annual Symposium on Foundations of Computer Science · 218

Asymptotic properties of minimax trees and game-searching procedures

1980 · Judea Pearl · Artificial Intelligence · 186

A minimax algorithm better than alpha-beta?

1979 · G.C. Stockman · Artificial Intelligence · 184

The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

1982 · Judea Pearl · Communications of the ACM · 173

PDF

GIB: Imperfect Information in a Computationally Challenging Game

2001 · M. L. Ginsberg · Journal of Artificial Intelligence Research · 157

PDF

Parallel Search of Strongly Ordered Game Trees

1982 · T. A. Marsland, M. Campbell · ACM Computing Surveys · 151

The *-minimax search procedure for trees containing chance nodes

1983 · Bruce W. Ballard · Artificial Intelligence · 127

Conspiracy numbers for min-max search

1988 · David Allen McAllester · Artificial Intelligence · 121

Experiments With Some Programs That Search Game Trees

1969 · James R. Slagle, John E. Dixon · Journal of the ACM · 118

PDF

Best-first fixed-depth minimax algorithms

1996 · Aske Plaat, Jonathan Schaeffer, et al. · Artificial Intelligence · 110

PDF

A game-based approximate verification of deep neural networks with provable guarantees

2019 · Min Wu, Matthew Wicker, et al. · Theoretical Computer Science · 109

The principal continuation and the killer heuristic

1977 · Selim G. Akl, Monroe M. Newborn · ACM Annual Conference · 99

PDF

Game tree searching by min/max approximation

1987 · Ronald L. Rivest · Artificial Intelligence · 97

PDF

Some studies in machine learning using the game of checkers. II—Recent progress

1969 · A.L Samuel · Annual Review in Automatic Programming · 89

Optimal Search on Some Game Trees

1983 · Michael Tarsi · Journal of the ACM · 80

PDF

Intelligent Systems : A Modern Approach

2011 · Grosan, Crina, Abraham, Ajith 1968- · 78

On the branching factor of the alpha-beta pruning algorithm

1978 · Gérard M. Baudet · Artificial Intelligence · 72

Analysis of the alpha-beta pruning algorithm

2018 · Fuller, Samuel H., Gaschnig, John G., et al. · Figshare · 68

PDF

On Pruning Techniques for Multi-Player Games

2000 · Nathan Sturtevant, Richard E. Korf · National Conference on Artificial Intelligence · 68

Best-first minimax search

1996 · Richard E. Korf, David Maxwell Chickering · Artificial Intelligence · 59

A generalised quiescence search algorithm

1990 · Don F. Beal · Artificial Intelligence · 56

Works count: 924

Citation count: 8,413