Question 1

Rubrics:

(a) 3 points:

• 0.5 points for path. The path is A—> C—> D —>E —> G

• 0.5 points for reasoning that the path is not optimal

• 1 point for the right expansion list: A,C,D,F,B,E,G

• 1 point for the search tree.

  

(b) 3 points:

• 0.5 points for path. A—>C—>D—>F—>G
• 0.5 for stating that the path is not optimal
• 1 point for correct list of expansion A,C,D,F
• 1 point for search tree

(c) 4 points

• 1 point for correct point for correct path (A—>B—>D—>E—>G) and stating the path is correct
• 3 points for reasoning. The heuristics in part (a) is admissible but not consistent. Hence graph search may not give optimal path

Question 2