Simulated Annealing Algorithm

Last time: Simulated
annealing algorithm
Idea: Escape local extrema by allowing
bad moves, but gradually decrease bad moves, but gradually decrease
their size and frequency.
Note: goal here is to
maximize E.
-
1
Last time: Simulated
annealing algorithm
Idea: Escape local extrema by allowing
bad moves, but gradually decrease bad moves, but gradually decrease
their size and frequency.
Algorithm when goal
is to minimize E.
<
-
2
-
This time: Outline
Game playing
The minimax
l ith algorithm
Resource limitations
alpha-beta pruning
3
alpha beta pruning
Elements of chance
What kind of games?
Abstraction: To describe a game we
must capture every relevant aspect of
the game. Such as:
Chess
Tic-tac-toe

Accessible environments: Such
games are characterized by perfect
4
games are characterized by perfect
information
What kind of games?
Search: game-playing then consists of
a search through possible game
positions
Unpredictable opponent: introduces
uncertainty thus game-playing must uncertainty thus game playing must
deal with contingency problems
5
Searching for the next move
Complexity: many games have a huge
search space search space
Chess: b = 35, m=100 nodes =35
100
if each node takes about 1 ns to explore p
then each move will take about 10
50
millennia to calculate.
6
Searching for the next move
Resource (e.g., time, memory) limit:
optimal solution not feasible/possible, optimal solution not feasible/possible,
thus must approximate
1 Pruning: makes the search more efficient 1. Pruning: makes the search more efficient
by discarding portions of the search tree
that cannot improve quality result.
2. Evaluation functions: heuristics to
evaluate utility of a state without exhaustive
7
search.
Two-player games
A game formulated as a search problem:
Initial state: ?
Operators: ? Operators: ?
Terminal state: ?
Utilit f ti ? Utility function: ?
8
Game vs. search problem
9
Example: Tic-Tac-Toe
Question:
1. b (branching factor) = ?
2 m(maxdepth) =? 2. m (max depth) = ?
10
Type of games
11
The minimax algorithm
Perfect play for deterministic
environments with perfect information
Basic idea: choose move with highest
minimax value
= best achievable payoff against best
play p y
12
The minimax algorithm
Algorithm:
1. Generate game tree completely
2. Determine utility of each terminal state
3. Propagate the utility values upward in the three by
applying MIN and MAX operators on the nodes in applying MIN and MAX operators on the nodes in
the current level
4. At the root node use minimax decision to select the
move with the max (of the mins) utility value
Steps 2 and 3 in the algorithmassume that
13
Steps 2 and 3 in the algorithm assume that
the opponent will play perfectly.
Generate Game Tree
14
Generate Game Tree
x
1 ply
1 move
o x
x
o
x
o
x o
15
A subtree
x x
o
win
lose
x x
o
o
o
x
lose
draw
x x
o
o
o
x
x x
o
o
o
x x
x x
o
o
o
x
x x o o o x x
x x
o
o
x x
x x
o
o
x x
x x
o
o
x
x x
o
o
x
x x
o
o
x
x x
o
o
x o
o
o o o x o x
o x
o x o
o o o
x x
o
o
x x
x x
o
o
x x
x x
o
o
x o
x x
o
o
x
o
x
x x
o
o
x
16
o
o
x x
o x x x x
o
o
x x
o
o
o
x
x
o o
o
x
x
o
x o
o
x
x o
What is a good move?
x x
o
win
lose
x x
o
o
o
x
lose
draw
x x
o
o
o
x
x x
o
o
o
x x
x x
o
o
o
x
x x o o o x x
x x
o
o
x x
x x
o
o
x x
x x
o
o
x
x x
o
o
x
x x
o
o
x
x x
o
o
x o
o
o o o x o x
o x
o x o
o o o
x x
o
o
x x
x x
o
o
x o
x x
o
o
x
o
x
x x
o
o
x
17
o
o
x x
o x x x
o
o
x
x
o o
o
x
x
o
x o
o
x
x o
Minimax
3 8 12 4 6 14 2 5 2
Mi i i t h Minimize opponents chance
Maximize your chance
18
minimax = maximum of the
minimum
1
st
ply
2
nd
ply 2 ply
19
J avaApplet
-Minimx java applet
dd dd
20
Minimax: Recursive implementation p
21
Complete: ?
Optimal: ?
Time complexity: ?
Space complexity: ?
1. Move evaluation without
complete search
Complete search is too complex and impractical
Evaluation function: evaluates value of state
using heuristics and cuts off search
New MINIMAX:
CUTOFF-TEST: cutoff test to replace the termination
condition (e.g., deadline, depth-limit, etc.)
l f l l f EVAL: evaluation function to replace utility function
(e.g., number of chess pieces taken)
22
Do We Have To Do All That
Work?
MAX
MIN
3 8 12
23
Evaluation functions
Weighted linear evaluation function:
to combine n heuristics: f = w
1
f
1 +
w
2
f
2 + +
w
n
f
n
to combine n heuristics: f w
1
f
1 +
w
2
f
2 + +
w
n
f
n
E.g,
ws could be the values of pieces (1 for prawn, 3 for bishop)
24
p ( p , p)
fs could be the number of type of pieces on the board
Note: exact values do not matter
Ordering is preserved
25
Minimax with cutoff: viable
algorithm?
Assume we have
100 seconds,
evaluate 10
4
nodes/s; can nodes/s; can
evaluate 10
6
nodes/move
26

Simulated Annealing Algorithm

Uploaded by

Copyright:

Available Formats

Simulated Annealing Algorithm

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Simulated Annealing Algorithm

Uploaded by

Copyright:

Available Formats

Last time: Simulated

You might also like