THE UNIVERSITY OF AUCKLAND
SEMESTER TWO 2020 Campus: City
COMPUTER SCIENCE Artificial Intelligence
(Time Allowed: TWO hours)
NOTE:
This exam is out of 100 marks.
Attempt ALL questions.
Write your answers in the space provided in this booklet. There is space at the back for answers that overflow the allotted space.
The use of calculators is NOT permitted.
Question 10
Given a unit-cost domain problem, P, with an optimal cost solution of 20, a front-to-end heuristic h, whose max heuristic value is 9 and whose average heuristic value for this problem is 7, and the GBFHS search algorithm with a split function that guarantees it "meets-in-the-middle". Explain why h is useless as a heuristic (i.e., is no better than blind) for solving P. Specifically, what must be true of h’s value for GBFHS to expand a node?