Scribd
Upload
38 views4 pages

ECE479579 Class Notes 02-26

Uploaded by

vincent xu
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
38 views4 pages

ECE479579 Class Notes 02-26

Uploaded by

vincent xu
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
You are on page 1/ 4

02/26/2018 ECE479/579 - Lecture (18)

Continue with game tree


Alpha and beta pruning (search algorithm)

α/β pruning
1. Searching can be discontinued below
any Min node whose β <= α of any of
its ancestors. (alpha cut-off)

2. Search can be discontinued below an Max node whose α >= β of any of its ancestors
(beta cut-off)

1
Example

Example (exercise)
Using alpha beta pruning to find the winning path

2
02/26/2018 ECE479/579 - Lecture (18)

What is the limitation?

If have 16 parallel processors, it is easy to evaluate by using alpha beta.

Example
To demonstrate that partial state of the game can be assigned an evaluation to help alpha beta
pruning.

Example
Tic Tac Toe game
State
• X for Max player
• O for Min player
• e(s) if S is a win for max
then e(s) =∞
• e(s) if s is a win for min
then e(s) = - ∞

e(s) = {number of rows, columns, and diagonal open for max}


e(s) = - {number of rows, columns, and diagonal open for min}

• calculate the number of rows, column and diagonal for X


2 rows, 2 columns, 2 diagonal.  2+2+2 = 6

• calculate the number of rows, column and diagonal for O


2 rows, 2 columns, 1 diagonal.  2+2+1 = 5

e(s)= Max – Min = 6-5= 1

3
Example

You might also like