1- Students completing this course will demonstrate mastery of knowledge representation suitable for
AI processes and tools.
Of the four categories of artificial intelligence definitions (Figure 1.1, page 2) which do
you find to be the most difficult to implement in current and future artificial intelligences? Support your
choices with at least two specific instances of artificial intelligences, describing the difficulty you identify?
2- Students completing this course will be will demonstrate mastery of standard AI search techniques.
Compare, at a high level, classical search and adversarial search by describing the primary
attributes of each search technique and identifying primary attributes that differ between them.
3- Students completing this course will demonstrate fundamental understanding of expert system
construction and validation.
We lightly covered expert systems at multiple points during the semester. If you were
asked to construct and validate an expert system what steps would you take to accomplish that task?
4- Aware of current trends and directions in the field
SLO-G (10 points)
Choose one current trend, provide a two-paragraph summary of the trend, and
support your two-paragraph summary with citations from referred journals or publications.
Problem 1 :
Earlier this semester while responding to a homework problem you considered the Turing Test. The
Turing Test focuses on question-response sequences. For each of the following situations define a
test or set of tests to determine the quality of the artificial intelligence that might be used. For each
situation your answer must address how your test assesses each of the artificial intelligence
definitions in Figure 1-1, page 2, of AIMA
.
1. (U 5/G 5) autonomous vehicles
2. (U 5/G 5) adaptive control for drug delivery systems
3. (U 5/G 5) computational intelligence and artificial intelligence in games
Problem 2 :
Find a path from s to g in the following maze using the A* algorithm:
Problem 3 : Using Hill Climbing, find the maximum number of satisfiable clauses:
1. ( ∨ ¬ ∨ ) 2. (¬ ∨ ∨ ) 3. ( ∨ ∨ ¬ ) 4. (¬ ∨ ¬ ∨ ¬ ) 5. (¬ ∨ ¬ ∨ )
Problem 4 Solve the following Sudoku puzzle as a constraint satisfaction problem (CSP), documenting your CSP
work.
Problem 5 :
Heuristic Search: This puzzle has three black and three white tiles and a blank space. Objective is to
get all the white tiles to left of all black tiles: position of the blank space is not important.
Rules: A tile may move into adjacent empty location at cost of 1. Or it can hop over one or two other
tiles into the empty position at a cost of the number of tiles hopped over.
a) Analyze the state space: are there loops, about how big is it, what is the branching factor?
b) Propose a heuristic for an A* search on this problem. Is it admissible? Is it consistent?
0 comments