Midterm Preparation.
The midterm will test all material, not only material after the midterm. Notice that the following
questions are a sample of the kind of questions that could be on the midterm. However, they cer
tainty do not cover everything that could be on the midterm. They are merely intended to give you
some idea of the kind of questions that you can expect. The homeworks also give you an idea of
the kind of questions that you can expect. In general, you probably want to look at all of the
assignments (including sample solutions), handouts, slides, and the book. Please do not forget to
bring a calculator to the midterm.
You want to solve a map coloring problem: given the map of
some country, you want to color its
states so that neighboring states have different colors, using a total of 5 colors. Which AI tech
niques can be applied to this problem, and why?
TRUE of FALSE?
No search method that makes use of heuristic functions can GUARANTEE to find a shortest path
from the start to a goal: true or false.
Breadthfirst search always terminates if there is a path from the start to the goal: true or false.
Depthfirst search always terminates if there is a path from the start to the goal: true or false.
A* is an informed version of depthfirst search, that is, a version of depthfirst search that uses a
heuristic function to bias the search towards the goal states: true or false.
Given two admissible heuristic functions, at least one dominates the other one: true or false.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '08
 SvenKoenig
 Artificial Intelligence, Search algorithms, Search algorithm, Graph algorithms, Consistent heuristic

Click to edit the document details