Alpha-beta pruning is a search algorithm used in decision-making, game theory in AI. Alpha-beta pruning is optimization technique for minimax algorithm or you can say it is the advanced version of minimax algorithm. It is used in Games like tic-tac-toe, chess and checkers.
Alpha: In Alpha-Beta Pruning Alpha is the best choice for highest value found and the initial value of Alpha is -.
Beta: Beta is the best choice for lowest value found and the initial value of Beta is + ∞.
The technique by which, without checking each node of the Game tree we can compute the correct minmax decision, and this technique is called Pruning. This involves two threshold parameter Alpha and Beta for future expansion, so it is called Pruning.
Alpha-beta pruning searches the best path for the max player. It eliminates parts of the tree, explores a smaller number of nodes so time is reduced. It returns the same number of moves like minimax algorithm but it will prune away branches that won’t affect the final decision.
Significance of Alpha-beta Pruning
Silan Software is one of the India's leading provider of offline & online training for Java, Python, AI (Machine Learning, Deep Learning), Data Science, Software Development & many more emerging Technologies.
We provide Academic Training || Industrial Training || Corporate Training || Internship || Java || Python || AI using Python || Data Science etc