Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

18 relations
AlphaGoBranch and boundBranching factorCombinatorial optimization
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
The game of chess is the most widely-studied domain in the history of artificial intelligence. The strongest programs are based… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2017
Highly Cited
2017
Learning Efficient Convolutional Networks through Network Slimming
The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Bandit Based Monte-Carlo Planning
For large state-space Markovian Decision Problems Monte-Carlo planning is one of the few viable approaches to find near-optimal… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in… Expand
  • figure 1
  • table 2
  • table 3
  • table 1
  • table 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A fast distributed algorithm for mining association rules
With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Multi-Player Alpha-Beta Pruning
  • R. Korf
  • Artif. Intell.
  • 1991
    • Corpus ID: 14171052
Korf, R.E., Multi-player alpha-beta pruning (Research Note), Artificial Intelligence 48 (1991) 99-111. We consider the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Logical foundations of artificial intelligence
Typographical Conventions 1 Introduction 1.1 Bibliographical and Historical Remarks Exercises 2 Declarative Knowledge 2.1… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
M. Douglas Mcllroy* and Data Structures Editor stop(top). In such a situation, the element top has to be deleted from the stack… Expand
  • figure 1
Is this relevant?
Highly Cited
1978
Highly Cited
1978
On the Branching Factor of the Alpha-Beta Pruning Algorithm
  • G. Baudet
  • Artif. Intell.
  • 1978
    • Corpus ID: 42932954
An analysis of the alpha-beta pruning algorithm is presented which takes into account both shallow and deep cut-offs. A formula… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
An Analysis of Alpha-Beta Pruning
Abstract The alpha-beta technique for searching game trees is analyzed, in an attempt to provide some insight into its behavior… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE