Alpha-beta pruning is an altered version of the minimax algorithm, and it allows the removal of parts of the game tree that are useless to examine. With pruning, searching for a good move becomes more efficient. The main idea of alpha-beta pruning is that if one step is worse than the already examined other, it is pointless to examine the worse one further.
Explain alpha-beta pruning. Use examples.
Answer by Academic.tip's expert
An answer to this question is provided by one of our experts who specializes in technology & it. Let us know how much you liked it and give it a rating.
Cite this page
Select a citation style:
References
Academic.Tips. (2021) 'Explain alpha-beta pruning. Use examples'. 2 October.
Reference
Academic.Tips. (2021, October 2). Explain alpha-beta pruning. Use examples. https://academic.tips/question/explain-alpha-beta-pruning-use-examples/
References
Academic.Tips. 2021. "Explain alpha-beta pruning. Use examples." October 2, 2021. https://academic.tips/question/explain-alpha-beta-pruning-use-examples/.
1. Academic.Tips. "Explain alpha-beta pruning. Use examples." October 2, 2021. https://academic.tips/question/explain-alpha-beta-pruning-use-examples/.
Bibliography
Academic.Tips. "Explain alpha-beta pruning. Use examples." October 2, 2021. https://academic.tips/question/explain-alpha-beta-pruning-use-examples/.
Work Cited
"Explain alpha-beta pruning. Use examples." Academic.Tips, 2 Oct. 2021, academic.tips/question/explain-alpha-beta-pruning-use-examples/.
Copy