COMP 413 AI. Assignment 1
a) You and some friends are lost in a new city . You get into a big fight about the best
way to find a path from your start position (S) to your goal (G), and so you split up
and each try a different search technique. You and your friends always break ties in
lexicographic order.
i) One of your friend Tom decides to try Hill-Climbing using an extended list, because
it seems like the easy way out. What is the final path that Tom will find?
ii) How many times will Tom need to backtrack, show your workings.
iii) James suggests that you use an A* search using both the heuristic and an extended
list, show James tree like solution .
iv) What is the final path that James will find?
v) Kamau is still skeptical about the results so far. he proposes a branch-and-bound
search instead. Will Kamau search produce the same path as James ? If so, explain
why. If not, explain why not
b) Describe PEAS model for the following AI agent
An agent that reports threat of flood activity in Kenya:
An agent to detect COVID-19 Virus
NAKURU-KABARAK pothole filler agent
