Scribd
Upload
25 views

Lecture7 Part2

The document describes adversarial search and the minimax algorithm. It discusses how minimax works by having MAX aim to maximize the score while MIN aims to minimize the score. It provides pseudocode for the minimax algorithm using the minimax, max-value, and min-value functions. It also discusses how alpha-beta pruning can optimize minimax search by pruning branches that cannot affect the outcome.

Uploaded by

Amir Mohamed Nabil Saleh Elghamery
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
25 views

Lecture7 Part2

The document describes adversarial search and the minimax algorithm. It discusses how minimax works by having MAX aim to maximize the score while MIN aims to minimize the score. It provides pseudocode for the minimax algorithm using the minimax, max-value, and min-value functions. It also discusses how alpha-beta pruning can optimize minimax search by pruning branches that cannot affect the outcome.

Uploaded by

Amir Mohamed Nabil Saleh Elghamery
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

Adversarial Search

O X
O X X
O X
O X
O X X
O X
Minimax
O X X X O X O X
O O O O X X O
O X X X X O X O X

-1 0 1
Minimax

• MAX (X) aims to maximize score.


• MIN (O) aims to minimize score.
Game
• S0 : initial state
• PLAYER(s) : returns which player to move in state s
• ACTIONS(s) : returns legal moves in state s
• RESULT(s, a) : returns state after action a taken in state s
• TERMINAL(s) : checks if state s is a terminal state
• UTILITY(s) : final numerical value for terminal state s
Initial State
PLAYER(s)

PLAYER( )= X

PLAYER( X )= O
ACTIONS(s)

X O O
ACTIONS( O X X )={ ,
O
}
X O
RESULT(s, a)

X O O X O
O
RESULT( O X X , )= O X X
X O X O
TERMINAL(s)
O
TERMINAL( O X ) = false
X O X

O X
TERMINAL( O X ) = true
X O X
UTILITY(s)
O X
UTILITY( O X )= 1
X O X

O X X
UTILITY( X O ) = -1
O X O
O X O
O X X
X X O
VALUE: 1
MIN-VALUE: X O
PLAYER(s) = O 0 O X X
X O

O X O X O
MAX-VALUE: MAX-VALUE:
1 O X X 0 O X X
X O X O O

O X O X X O
VALUE: O X X VALUE: O X X
1 0
X X O X O O
MIN-VALUE: X O
PLAYER(s) = O 0 O X X
X O

O X O X O
MAX-VALUE: MAX-VALUE:
1 O X X 0 O X X
X O X O O

O X O X X O
VALUE: O X X VALUE: O X X
1 0
X X O X O O
MAX-VALUE:
1
X O
PLAYER(s) = X O X
X O

MIN-VALUE: X O MIN-VALUE: X X O VALUE: X O


0 -1 1
O X X O X O X
X O X O X X O

O X O X O X X O X X O
MAX-VALUE: MAX-VALUE: VALUE: MAX-VALUE:
1 O X X 0 O X X -1 O X O 0 O X
X O X O O X O X O O

O X O X X O X X O
VALUE: O X X VALUE: O X X VALUE: O X X
1 0 0
X X O X O O X O O
9

5 3 9
8

9 8

5 3 9 2 8
Minimax

• Given a state s:
• MAX picks action a in ACTIONS(s) that produces
highest value of MIN-VALUE(RESULT(s, a))
• MIN picks action a in ACTIONS(s) that produces
smallest value of MAX-VALUE(RESULT(s, a))
Minimax

function MAX-VALUE(state):
if TERMINAL(state):
return UTILITY(state)
v = -∞
for action in ACTIONS(state):
v = MAX(v, MIN-VALUE(RESULT(state, action)))
return v
Minimax

function MIN-VALUE(state):
if TERMINAL(state):
return UTILITY(state)
v=∞
for action in ACTIONS(state):
v = MIN(v, MAX-VALUE(RESULT(state, action)))
return v
Optimizations
4

4 5 3 2

4 8 5 9 3 7 2 4 6
4

4 5 ≤3 ≤2

4 8 5 9 3 2
Alpha-Beta Pruning

You might also like