Scribd
Upload
4 views10 pages

Alpha Beta Pruning

Alpha-beta pruning is a technique used in game theory to optimize decision-making in two-player games like chess by reducing the number of game states evaluated. It involves maintaining two values, alpha and beta, to prune branches of the game tree that do not need further exploration. This results in faster decision-making while ensuring optimal moves are still identified, enhancing the performance of game engines and AI systems.

Uploaded by

Aastha Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views10 pages

Alpha Beta Pruning

Alpha-beta pruning is a technique used in game theory to optimize decision-making in two-player games like chess by reducing the number of game states evaluated. It involves maintaining two values, alpha and beta, to prune branches of the game tree that do not need further exploration. This results in faster decision-making while ensuring optimal moves are still identified, enhancing the performance of game engines and AI systems.

Uploaded by

Aastha Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

ALPHA

BETA
PRUNING
INTRODUCTIO
N ALPHA-BETA PRUNING IS A TECHNIQUE
USED IN GAME THEORY, ESPECIALLY IN
TWO-PLAYER GAMES LIKE CHESS OR TIC-
TAC-TOE, TO MAKE THE DECISION-MAKING
PROCESS FASTER AND MORE EFFICIENT. IT
HELPS REDUCE THE NUMBER OF GAME
STATES THE ALGORITHM NEEDS TO
EVALUATE TO DETERMINE THE BEST
POSSIBLE MOVE.
GAME TREE
In games like chess, possible moves and
their outcomes can be represented as a tree
structure. The root node (starting point)
represents the current game state, and each
branch represents a possible move. The tree
grows with each move, and it becomes huge
as more moves are considered.
ALPHA BET PRUNING
A
The best value that the The best value that the A situation where one
maximizing player (Max) minimizing player (Min) player's move would result
can guarantee at any point can guarantee. Beta is in a value worse than what
in the game tree. Alpha is updated when Min finds a the other player has
updated when Max finds a worse option for Max. already found, it "prunes"
better option. or cuts off that branch
because it's unnecessary
to explore further.
CONCLUSION
Alpha-beta pruning is an optimization technique that enhances
the minimax algorithm by reducing the number of moves
evaluated in a game tree. It skips unnecessary branches, allowing
faster decision-making without compromising the result. In
games like chess, this technique helps efficiently find optimal
moves by focusing only on relevant positions, improving the
performance of game engines and AI systems.
THANK
YOU

You might also like