This preview shows page 1. Sign up to view the full content.
NAME:
3
(c) (2 pt)
Would depthﬁrst graph search be complete for the search problem you deﬁned? Explain.
No, depthﬁrst search would not be complete because the state space is inﬁnite. Depthﬁrst search could
forever keep expanding states with increasing distance to the goal.
(d) (3 pt)
Design a nontrivial, admissible heuristic for this problem.
Distance to exit divided by 2 is admissible because each step can move Crawler at most 2 meters closer
to the goal. A slightly better heuristic would be to round this heuristic up to the nearest integer.
(e) (4 pt)
Crawler’s shoulder overheats if it switches direction more than once in any three consecutive time
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 08/30/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.
 Spring '08
 Staff
 Artificial Intelligence

Click to edit the document details