Q1: Uniform Cost

In the graph attached we want to find a path from A to H using uniform cost. What is the order of expansion? And the cost of each new node we expand to? Write the name of the node and cost seperated by comma. For instance, if A,B,H was the order of expansion then you would write: A,0,B,13,H,16 Another example, if you started the expansion with A,F,G then you would write A,0,F,5,G,11,...

Q2: For the following graph and given that start is the initial state and goal is the goal state, what is the order of expansion of the nodes for a unifrom-cost search? And consider the previous question. What is the minimum path cost for a uniform cost?

Q3:

If h(n) is the heuristic function and g(n) is the cost function, then the evaluation function for the greedy search should be:

A) f(n) = h(n)

B) f(n) = g(n) - h(n)

C) f(n) = g(n)

D) f(n) = g(n) + h(n)

NO 30 TA3 15 +6720 Start 20 Goal 15 B - 30 or NO 30 TA3 15 +6720 Start 20 Goal 15 B - 30 or