Question 6. (SU7+SU8) Compare... depth-first search, breadth-first search and best-first search on the following graph b

[correctanswer]

Question 6 Su7 Su8 Compare Depth First Search Breadth First Search And Best First Search On The Following Graph B 1 (130.47 KiB) Viewed 54 times

Question 6. (SU7+SU8) Compare... depth-first search, breadth-first search and best-first search on the following graph by answering the questions below. The start node is D and the goal node is M. The numbers show the distance between nodes for use by the best-first algorithm. 4 6.1 For depth-first and breadth-first, give the sequence in which the nodes are evaluated from I to J. G J M 6.2 For best-first, show all your steps clearly and at each step show the following (e.g. in a table): The node being evaluated, the open list, the closed list. 6.3 Which one of these algorithms evaluates the least nodes? Also, specify how many it evaluates. 6.4 Which one of these algorithms finds the shortest path? What are the shortest path and its length? 3 H 3 4 K 1 1 F 4 1 A 2 B [12] 4 1 (6) (2) (2)