Progressive Deepening

A B

C D E F

G H I J

K L M N
 Heuristically Informed
• Heuristic Example
A B 3 C
2
5
– Here you see the

6
G
S
distances between each 4
city and the goal D E 3 F
3

– If you wish to reach the

3 3
goal, it is usually better to A B C
be in a city that is close,

2
but not necessarily; city C

4
G
S
is closer than, but city C is
not a good place to be 3
D E F
2
1 3
 Hill Climbing
S
9 11
A B
7.3 8.5 9 9
C D E F
7
6
G H 5 I J
6 4
4
2 0
K L M N

Hill Climbing is DFS with a heuristic measurement

that orders choices. The numbers beside the
nodes are straight-line distances from the path-
terminating city to the goal city.
 Beam Search
Degree = 2
S
At every level use only 2
9 11
best nodes A B
7.3 8.5 7.1 9
C D E F
7
5.3
G H 5 I J
6 2
4
2.5 0
K L M N