Progressive Deepening A B C D E F G H I J K L M N

Heuristically Informed Heuristic Example Here you see the distances between each city and the goal If you wish to reach the goal, it is usually better to be in a city that is close, but not necessarily; city C is closer than, but city C is not a good place to be A B 3 C 2 5 6 S G 4 3 D E 3 F 3 3 A B C Page 43 of Elaine Rich 2 4 4 S G 3 2 D E F 1 3

Hill Climbing Hill Climbing is DFS with a heuristic measurement 11 9 A B 7.3 8.5 9 9 C D E F 7 5 6 G H I J 6 4 4 2 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 best nodes S 11 9 A B 7.3 8.5 7.1 9 C D E F 7 5 5.3 G H I J 6 2 4 2.5 K L M N