alpha–beta pruning
search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree
Facts
2 propertiesIdentity
- Instance of
- search algorithm
More facts +1
- Discoverer or inventor
- Alexander Brudno, Arthur Samuel[2][3]
🏷️ Also known as
en alpha-beta pruning
en alpha–beta pruning
ar تقييم ألفا بيتا
cs Alfa-beta ořezávání
de Alpha-Beta-Suche
es poda alfa-beta
fa هرس آلفا بتا
fr élagage alpha-beta
he גיזום אלפא-ביתא
hu Alfa-béta vágás
it potatura alfa-beta
ja アルファ・ベータ法
ko 알파-베타 가지치기
pl Algorytm alfa-beta
ru Альфа-бета-отсечение
uk Альфа-бета-відсічення
zh Alpha-beta剪枝
🔖 Identifiers · 7
- Chess Programming Wiki ID
- Alpha-Beta
- Encyclopedia of China (Third Edition) ID (2026)
- 2zO26z
- Encyclopedia of China (Third Edition) old ID (2021)
- 41702
- Freebase ID
- /m/0151cx
- MathWorld ID
- Alpha-BetaPruning
- Microsoft Academic ID (discontinued)
- 19001118
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Discoverer or inventor 2
Created notable works 1
Instance of 1
Maintained by WikiProject 1
← FactGrid item ID 1
Press Enter · cited answer in seconds
0 sources
Summary
alpha–beta pruning is a search algorithm[1].