2 4 1 D GI E G2 2. 2.
Consider the search space below, where S is the start node and G1 and G2 satisfy the goal test.
Arcs are labeled with the cost of traversing them and the estimated cost to a goal is reported
inside nodes.
For each of the following search strategies, indicate which goal state is reached (if any) and list,
in order, all the states popped off of the OPEN list. When all else is equal, nodes should be
removed from OPEN in alphabetical order.
You can show your work (for cases of partial credit) on the back of the previous page.
Breadth-first search
Goal state reached: _______ States popped off OPEN: ____________________________________
Hill Descending Search
Goal state reached: _______ States popped off OPEN: ____________________________________
A* (f = g + h)
Goal state reached: _______ States popped off OPEN: ____________________________________
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
