(2-a) Consider the following state space and the heuristic function associated. The initial state is A...

 

Transcribed Image Text:

(2-a) Consider the following state space and the heuristic function associated. The initial state is A and the goal state is F. 3 3 1 B D F 1 3. A 1 2 E Page (1/2) Show the result of Uniform cost search algorithm on this search tree. (2-b) Is the uniform cost search (as presented in class and Text Book) a tree search or a graph search? Explain why should it be this way? (2-c) When the heuristic function h(n) (where & is a small positive constant) the states expanded by A* algorithm will be a subset of uniform cost search. Why or why not? (2-a) Consider the following state space and the heuristic function associated. The initial state is A and the goal state is F. 3 3 1 B D F 1 3. A 1 2 E Page (1/2) Show the result of Uniform cost search algorithm on this search tree. (2-b) Is the uniform cost search (as presented in class and Text Book) a tree search or a graph search? Explain why should it be this way? (2-c) When the heuristic function h(n) (where & is a small positive constant) the states expanded by A* algorithm will be a subset of uniform cost search. Why or why not?