Alpha–beta pruning

Known as: Alphabeta pruning, Alpha-beta search, A-b pruning 
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree… (More)
Wikipedia

Related topics

Related topics

18 relations
AlphaGoBranch and boundBranching factorCombinatorial optimization
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Alpha-Beta Pruning for Games with Simultaneous Moves
Alpha-Beta pruning is one of the most powerful and fundamental MiniMax search improvements. It was designed for sequential two… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Analysis of the alpha-beta pruning algorithm
Many game-playing programs must search very large game trees. Use of the alpha-beta pruning algorithm instead of the simple… (More)
  • figure 1.1
  • figure 2.2
  • figure 2.3
  • figure 3
  • figure 2.4
Is this relevant?
2009
2009
Improved Alpha-Beta Pruning of Heuristic Search in Game-Playing Tree
The game playing is an import domain of heuristic search, and its procedure is represented by a special and/or tree. Alpha-beta… (More)
  • figure 1
  • table 1
  • figure 3
Is this relevant?
2001
2001
Alpha-Beta Pruning Under Partial Orders
Alpha-beta pruning is the algorithm of choice for searching game trees with position values taken from a totally ordered set… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1991
1991
Multi-Player Alpha-Beta Pruning
Korf, R.E., Multi-player alpha-beta pruning (Research Note), Artificial Intelligence 48 (1991) 99-111. We consider the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1988
1988
Distributed Tree Search and Its Application to Alpha-Beta Pruning
We propose a parallel tree search algorithm based on the idea of tree-decomposition in which different processors search… (More)
  • figure 1
Is this relevant?
1983
1983
A Quantitative Analysis of the Alpha-Beta Pruning Algorithm
Since the earl). 70s the question o]" efficiency of the alpha-beta pruning algorithm has been of interest to those who have been… (More)
  • figure 2
  • table 1
  • figure 3
  • table 2
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A Minimax Algorithm Better than Alpha-Beta?
An algorithm based on state space search is introduced for computing the minimax value o f game trees. The new algorithm SSS, is… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
1978
1978
An Analysis of the Full Alpha-Beta Pruning Algorithm
An analysis of the alpha-beta pruning algorithm is presented which takes into account both shallow and deep cut-offs. A formula… (More)
  • figure 2.2
  • figure 2.1
  • figure 4.1
  • table 5.1
Is this relevant?
Highly Cited
1975
Highly Cited
1975
An Analysis of Alpha-Beta Pruning
 
Is this relevant?