1. Identify the optimal path from the starting point (Lagos) to the goal (Abuja) in the...

 

Transcribed Image Text:

1. Identify the optimal path from the starting point (Lagos) to the goal (Abuja) in the provided figure using: i) A* Star Search ii) Best First Search (BFS) The number outside the oval is the heuristics and the numbers within the oval are the edge cost. Ensure to show every step involved in detail. 347 Osogbo 19 406 305 302 Ibadan 11 Ilorin 23 Owo 37 487 Lagos 0 264 Akure 31 286 Ado Ekiti 38 418 Abeokuta 225 Abuja 65 382 Benin 27 314 Warri 46 Discuss the broad types of search algorithms and the difference between them. 363 Onitsha 56 1. Identify the optimal path from the starting point (Lagos) to the goal (Abuja) in the provided figure using: i) A* Star Search ii) Best First Search (BFS) The number outside the oval is the heuristics and the numbers within the oval are the edge cost. Ensure to show every step involved in detail. 347 Osogbo 19 406 305 302 Ibadan 11 Ilorin 23 Owo 37 487 Lagos 0 264 Akure 31 286 Ado Ekiti 38 418 Abeokuta 225 Abuja 65 382 Benin 27 314 Warri 46 Discuss the broad types of search algorithms and the difference between them. 363 Onitsha 56