Unformatted text preview: CS 188 Introduction to Spring 2009 Artificial Intelligence Midterm Solutions 1. (16 points) True/False For the following questions, a correct answer is worth 2 points, no answer is worth 1 point, and an incorrect answer is worth 0 points. Circle true or false to indicate your answer. a) ( true or false ) If g ( s ) and h ( s ) are two admissible A * heuristics, then their average f ( s ) = 1 2 g ( s ) + 1 2 h ( s ) must also be admissible. True . Let h * ( s ) be the true distance from s . We know that g ( s ) ≤ h * ( s ) and h ( s ) ≤ h * ( s ), thus f ( s ) = 1 2 g ( s ) + 1 2 h ( s ) ≤ 1 2 h * ( s ) + 1 2 h * ( s ) = h * ( s ) b) ( true or false ) For a search problem, the path returned by uniform cost search may change if we add a positive constant C to every step cost. True . Consider that there are two paths from the start state ( S ) to the goal ( G ), S → A → G and S → G ....
View Full Document
This note was uploaded on 08/30/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at Berkeley.
- Spring '08
- Artificial Intelligence