alpha–beta pruning
search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree
Press Enter · cited answer in seconds
0 sources
alpha–beta pruning
Summary
alpha–beta pruning is a search algorithm[1]. It draws 392 Wikipedia views per month (search_algorithm category, ranking #2 of 19).[2]
Key Facts
- alpha–beta pruning is credited with the discovery of Alexander Brudno[3].
- alpha–beta pruning is credited with the discovery of Arthur Samuel[4].
- alpha–beta pruning's instance of is recorded as search algorithm[5].
- alpha–beta pruning's Freebase ID is recorded as /m/0151cx[6].
- alpha–beta pruning's Stack Exchange tag is recorded as https://stackoverflow.com/tags/alpha-beta-pruning[7].
- alpha–beta pruning's MathWorld ID is recorded as Alpha-BetaPruning[8].
- alpha–beta pruning's maintained by WikiProject is recorded as WikiProject Mathematics[9].
- alpha–beta pruning's Microsoft Academic ID is recorded as 19001118[10].
- alpha–beta pruning's Encyclopedia of China is recorded as 41702[11].
- alpha–beta pruning's Chess Programming Wiki ID is recorded as Alpha-Beta[12].
Body
Designation and Status
alpha–beta pruning's instance of is recorded as search algorithm[5].
Why It Matters
alpha–beta pruning draws 392 Wikipedia views per month (search_algorithm category, ranking #2 of 19).[2] It has Wikipedia articles in 16 language editions, a strong signal of global cultural recognition.[13]