Considering the following search tree with start state A and goal state M with t
ID: 3705148 • Letter: C
Question
Considering the following search tree with start state A and goal state M with the edge cost g between nodes B- D B-E C-G E-H K--L L-M and the heuristic cost h to the goal state 13 ar . Node order: For each of the following search methods, show the order in which the nodes are visited. a. Breadth First Search b. Depth First Search e. Uniform Cost Search d Greedy best-first-search e. A Search 2. Admissibility: Is the heuristic admissible? Why or why not? What is the advantage of an admissible heuristic when used by A* search?Explanation / Answer
Solution:
Note: The first four subparts have been answered as per Chegg guidelines, please repost others.
1)
a)
BFS uses queue data structure to find the ordering and visit the vertices
BFS ORDER:
A B C D E G F H K I J L M
b)
The DFS uses stack data structure to find the ordering
A B D E H C G K L M F I J
c)
Uniform cost search
A B D C E H G K L M F I J
d)
Greedy best search
A B D E H C G K L M F I J
I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)