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 distances

6
S
G
between each city and the goal
4
3 3
D E F
• If you wish to reach the goal, it
is usually better to be in a city
that is close, but not 3 3
A B C
necessarily; city C is closer

2
than, but city C is not a good

4
S
G
place to be
3 2
D E F
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

At every level use only 2 S

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

In each level we pick two best nodes which has the less
heuristic among all.