Scribd
Upload
174 views7 pages

Alpha-Beta Pruning AI Example

- Alpha-beta pruning is a technique used in game tree search that prunes branches that cannot possibly change the outcome. - It works by tracking the maximum value the minimizer can achieve (alpha) and the minimum the maximizer can achieve (beta). If at any point alpha is greater than or equal to beta, we can prune the rest of the search tree from that node down. - The example shows alpha-beta pruning being applied to a game tree, with nodes being pruned (marked with '!!') once it is determined they cannot affect the result.

Uploaded by

VijayKumar Damera
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
174 views7 pages

Alpha-Beta Pruning AI Example

- Alpha-beta pruning is a technique used in game tree search that prunes branches that cannot possibly change the outcome. - It works by tracking the maximum value the minimizer can achieve (alpha) and the minimum the maximizer can achieve (beta). If at any point alpha is greater than or equal to beta, we can prune the rest of the search tree from that node down. - The example shows alpha-beta pruning being applied to a game tree, with nodes being pruned (marked with '!!') once it is determined they cannot affect the result.

Uploaded by

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

Alpha beta pruning

• Some branches will never be played by rational players since


they include sub-optimal decisions (for either player)

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX

MIN

MAX

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI
Alpha beta pruning. Example

MAX

MIN

MAX t 4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX

MIN
d 4

MAX
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI
Alpha beta pruning. Example

MAX

MIN
d 4

MAX
!!
4 t 6

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX t 4

MIN
4

MAX t 6
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI
Alpha beta pruning. Example

MAX t 4

MIN
4

MAX t 6 t 2
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX t 4

MIN d 2
4

MAX t 6 2
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI
Alpha beta pruning. Example

MAX t 4

!!
MIN d 2
4

MAX t 6 2
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX t 4

MIN d 2
4

MAX t 6 2 t 5
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI
Alpha beta pruning. Example

MAX t 4

MIN
4 d 2 d 5

MAX t 6 2 5
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX t 4

MIN
4 d 2 d 5

!!
MAX t 6 2 5 t 7
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI
Alpha beta pruning. Example

MAX t 5

MIN d 2 5
4

MAX t 6 2 5 t 7
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

CS 2710 Foundations of AI

Alpha beta pruning. Example

MAX 5

MIN d 2 5
4

MAX t 6 2 5 t 7
4

4 3 6 2 2 1 9 5 3 1 5 4 7 5

nodes that were never explored !!!

CS 2710 Foundations of AI

You might also like