The document discusses Alpha-Beta pruning, which is an enhancement to the minimax algorithm used in artificial intelligence to reduce calculation time when solving problems. It works by pruning branches in the game tree that do not need to be explored. This allows for quicker solving by cutting off branches where it is clear there is no need to explore deeper levels. The key advantages are reducing calculation time and only exploring parts of the tree that could potentially alter the result.

1. Presentation of Artificial
Intelligence
Submitted to:
MS Sadia
Submitted by:
MSC CS(Morning) 3rd Semester
Sania Komal 1773
Rabeah Basri 1758
Mahnoor Rahat 1748
Sania Kanwal 1774

2. PRESENTATION TOPIC:
ALPHA-BETA PRUNING

3. Contents:
 What is Alpha-Beta?
 Why we use Alpha-Beta pruning?
 What happened for reducing the time limit?
 Advantages
 What is Alpha and Beta in it?
 What is Alpha? What is Beta?
 Alpha Beta pruning (overview)

4. What is Alpha Beta?
Alpha Beta pruning is advanced part of minimax.
It is anything but another calculation. We consider
it an enhancement strategies for minimax
calculation.

5. Why we use Alpha Beta pruning?
Because which time limit we
required or have to solve a problem
of minimax it will reduce the time.

6. What happened for reducing the time
limit?
 It lessen the calculation time, enable us to
look a lot quicker.
 It cut off branches in the amusement tree
which require not be looked (In diversion
tree we go to more profound dimension for
looking through an esteem)

7. Advantages:
 The principle advantage is that when we
influence a diversion tree then it to can remove
those branches that we have no need (So we have
no compelling reason to go at that dimension to
fathom it)
 Because we have better move to go there.

8. What is Alpha ? What is Beta?
Alpha is the best value that maximizer
currently can guarantee at that level or
above.
Beta is the best value that minimizer
currently can guarantee at that level or
above.

21. ALPHA-BETA PRUNING (Overview):