1. CS 260 Search Exercise A B C D E F G H I J K L M
Consider the search graph below. The h value of a node is given adjacent to that node. The actual cost of traversing
an arc is given adjacent to that arc. Node A is the start/initial state. Nodes L and M are goals. Leaf states/nodes have no
successors. A 5 5 3 4 B C D 3 4 2 3 4 2 1 2 4 1 E F G H I J K 3 3 1 2 1 1 3 6 6 5 1 5 L M
Give the order in which nodes are visited (i.e., checked for goalness) by each of the following search strategies. In the
case of two or more nodes with the same evaluation score on the FRONTIER (priority queue), break the tie by
expanding/goal-checking the nodes from left-to-right as the nodes appear in the graph above.
Least-cost first search:
Heuristic depth-first search:
Best-first Search:
A* Search:
IDDFS: