# Assume you have the following search graph, where S is the start node and G1 and G2 are goal nodes. Arcs are labeled with the cost of traversing them and the estimated cost to a goal is reported inside nodes (i.e. h-value).

40 1

Get full Expert solution in seconds

\$1.97 ONLY

Assume you have the following search graph, where S is the start node and G1 and G2 are goal nodes. Arcs are labeled with the cost of traversing them and the estimated cost to a goal is reported inside nodes (i.e. h-value).

For each of the search strategies listed below,(a) indicate which goal state is reached (if any), (b) list, in order, all the states expanded, and (c) give a solution as a sequence of states. (Recall that a (non-goal) state is expanded when it is removed from the frontier list and then added to the explored list.) When all else is equal, nodes will be expanded in alphabetical order. A goal test is applied when a node is chosen from the frontier list.

(A)Breadth-First Search: Goal state reached, State expanded, Solution

(B)Depth-First search: Goal state reached, State expanded, Solution

(C)Uniform-Cost Search: Goal state reached, State expanded, Solution

(D)Iterative Deepening Search: Goal state reached, State expanded, Solution

(E)Hill Climbing Search (using function h only): Goal state reached, State expanded, Solution

(F)A* Search: a goal test is applied when it’s removed from the frontier list. For the states expanded, show both the states and their f values. Goal state reached, State expanded, Solution

(G)Imagine that the simulated annealing algorithm is applied. A node ‘A’ is the randomly chosen current node and a node ‘D’ is the candidate successor. Assume that the current temperature T at time (t= 2) equals 5. A. What is the probability that node D will be accepted as the next state? B. Assume that a node E is chosen as the candidate successor. What is the probability that E will be accepted as the next state?