Scribd
Upload
40 views10 pages

Adversarial Search: - Chapter 6 - Section 1 - 4 - VU-Lecture-10

The document discusses adversarial search and game playing. It explains that a game can be represented as a tree with nodes showing board configurations and branches indicating possible moves. The minimax procedure evaluates the best possible move for both players by alternating between maximizing and minimizing levels. Alpha-beta pruning improves on minimax by pruning branches that cannot affect the outcome.

Uploaded by

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

Adversarial Search: - Chapter 6 - Section 1 - 4 - VU-Lecture-10

The document discusses adversarial search and game playing. It explains that a game can be represented as a tree with nodes showing board configurations and branches indicating possible moves. The minimax procedure evaluates the best possible move for both players by alternating between maximizing and minimizing levels. Alpha-beta pruning improves on minimax by pruning branches that cannot affect the outcome.

Uploaded by

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

Adversarial Search

• Chapter 6
• Section 1 – 4
• VU-Lecture-10
Search and Game
Playing
• We will focus on Board Games
• We will represent the game as a tree

• The node is a
Original Board
game tree Situation
A

represent board
configuration,
and the New Board Situation
B C
branches
indicate how
moves can
connect them. New Board Situation
D E F G
The Minimax
Procedure
A Maximizing Level

B C Minimizing Level

D E F G
Maximizing Level

3 6 2 7
The Minimax
Procedure
3
A Maximizing Level

3 2
B C Minimizing Level

D E F G
Maximizing Level

3 6 2 7
Alpha Beta Pruning
=3
>=3
A Maximizing Level

=3
B =<2 C Minimizing Level

Maximizing Level

3 6 2
Alpha Beta Pruning
50
Maximizing Level

Minimizing Level

Maximizing Level

50 40 70 10 60 30 80 90 20 90 70 60
Alpha Beta Pruning
50
Maximizing Level

Minimizing Level

50 Maximizing Level

50 40 70 10 60 30 80 90 20 90 70 60
Alpha Beta Pruning
50
Maximizing Level

50
Minimizing Level

70
50 Maximizing Level

50 40 70 10 60 30 80 90 20 90 70 60
Alpha Beta Pruning
50
50
Maximizing Level

50 30 20
Minimizing Level

70 30 20
50 Maximizing Level

50 40 70 10 60 30 80 90 20 90 70 60

You might also like