Professional Documents
Culture Documents
L6&7 - 2022
L6&7 - 2022
SEARCH
AHMED EZZAT LABIB
HELWAN UNIVERSITY
HILL CLIMBING SEARCH
• QUEUEINGFN IS SORT-BY-H
• ONLY KEEP LOWEST-H STATE ON OPEN LIST
Path = { }
Open = {(A, 5)}
Current = {A}
HILL CLIMBING – EXAMPLE 1 2
A 3 1 2 3 4 5
h=5 4 5 8 6 7 8
6 7 Goal State
B C D
3 1 2 3 1 2 3 1 2
h=6 4 5 8 h=5 4 8 h=4 4 5 8
6 7 6 5 7 6 7
Path = {A}
Open = {(D, 4), (B, 6), (C, 5)}
Current = {D}
HILL CLIMBING – EXAMPLE 1 2
A 3 1 2 3 4 5
h=5 4 5 8 6 7 8
6 7 Goal State
B C D
3 1 2 3 1 2 3 1 2
h=6 4 5 8 h=5 4 8 h=4 4 5 8
6 7 6 5 7 6 7
E F
3 1 2 3 1 2
Path = {A, D} h=3 4 5 h=5 4 5 8
Open = {(E, 3), (F, 5)} 6 7 8 6 7
Current = {E}
HILL CLIMBING – EXAMPLE 1 2
A 3 1 2 3 4 5
h=5 4 5 8 6 7 8
6 7 Goal State
B C D
3 1 2 3 1 2 3 1 2
h=6 4 5 8 h=5 4 8 h=4 4 5 8
6 7 6 5 7 6 7
E F
3 1 2 3 1 2
Path = {A, D, E} h=3 4 5 h=5 4 5 8
Open = {(H, 2), (G, 4) , (I, 4)} 6 7 8 6 7
Current = {H}
G H I
3 1 3 1 2 3 1 2
h=4 4 5 2 h=2 4 5 h=4 4 5 8
6 7 8 6 7 8 6 7
1 2
HILL CLIMBING – EXAMPLE 3 4 5
G H I 6 7 8
3 1 3 1 2 3 1 2 Goal State
h=4 4 5 2 h=2 4 5 h=4 4 5 8
6 7 8 6 7 8 6 7
Path = {A, D, E, H}
Open = {(K, 1), (J, 3) , (L, 3) , (M, 3)}
Current = {K}
HILL CLIMBING – EXAMPLE
G H I
3 1 3 1 2 3 1 2
h=4 4 5 2 h=2 4 5 h=4 4 5 8
6 7 8 6 7 8 6 7
23
A* SEARCH – EXAMPLE 2
g(n)=140+140
g(n)=140+80
g(n)=140+99 g(n)=140+151
25
A* SEARCH – EXAMPLE 2
g(n)=0+140
g(n)=220
g(n)=140+99
g(n)=239
g(n)=220
g(n)=220+80
27
A* SEARCH – EXAMPLE 2
g(n)=317
g(n)=317+101
g(n)=317+138
28
A* SEARCH
Complete N Y Y Y N N N Y
Optimal N N Y N N N N Y
Heuristic N N N N Y Y Y Y
Time bm bd+1 bm bd bm bm nm bm
Space bm bd+1 bm bd bm b bn bm
PROBLEM – HILL CLIMBING SEARCH
• CONSIDER THE INITIAL STATE OF THE 4-QUEENS PROBLEM SHOWN BELOW.
• Consider the hill-climbing with number of conflicts heuristic
to find a valid state of the 4-queens problem.
• The heuristic value of a state is the number of distinct
queen pairs that can attack each other.
• The successors of a state are all possible states generated
by moving a single queen to another square in the same
column.
• Hill-climbing would at each step take the successor with
the smallest number of conflicts.
• DRAW THE TREE OF STATES THAT HILL-CLIMBING USING THE MINIMUM CONFLICT HEURISTIC EXPLORES
FROM THE INITIAL STATE TO ALL POSSIBLE EXPLORATION PATHS OF HILL-CLIMBING.
• ALSO WRITE THE OPEN LIST FOR THIS PROBLEM.