Alpha-beta剪枝
Sign in to saveAlso known as alpha-beta pruning
search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree
Wikidata facts
- Instance of
- search algorithm
Show 3 more facts
- maintained by WikiProject
- WikiProject Mathematics
- Stack Exchange tag
- stackoverflow.com/tags/alpha-beta-pruning
- discoverer or inventor
- Arthur Samuel
Sources (1)
via Wikidata · CC0
Article · 中文
Alpha-beta剪枝是一种搜索算法，用以减少极小化极大算法（Minimax算法）搜索树的节点数。这是一种对抗性搜索算法，主要应用于机器游玩的二人游戏（如井字棋、象棋、围棋）。当算法评估出某策略的后续走法比之前策略的还差时，就会停止计算该策略的后续发展。该算法和极小化极大算法所得结论相同，但剪去了不影响最终决定的分枝。
Abstract from DBpedia / Wikipedia · CC BY-SA