Skip to search formSkip to main contentSkip to account menu

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… 
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
2018
Highly Cited
2018
To prune, or not to prune: exploring the efficacy of pruning for model compression
Model pruning seeks to induce sparsity in a deep neural network's various connection matrices, thereby reducing the number of… 
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… 
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… 
Highly Cited
2017
Highly Cited
2017
Structured Pruning of Deep Convolutional Neural Networks
Real-time application of deep learning algorithms is often hindered by high computational complexity and frequent memory accesses… 
Highly Cited
2007
Highly Cited
2007
Efficient WFST-Based One-Pass Decoding With On-The-Fly Hypothesis Rescoring in Extremely Large Vocabulary Continuous Speech Recognition
This paper proposes a novel one-pass search algorithm with on-the-fly composition of weighted finite-state transducers (WFSTs… 
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… 
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… 
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… 
Highly Cited
1987
Highly Cited
1987
Logical foundations of artificial intelligence
Highly Cited
1975
Highly Cited
1975
An Analysis of Alpha-Beta Pruning
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