CS360 Homework 13
Decision Trees
1) Assume that you have the following training examples available:
Example
Example
Example
Example
Example
Example
Example
1
2
3
4
5
6
7
F1
t
f
t
t
f
t
f
F2
t
f
f
f
t
t
t
F3
f
t
f
t
f
f
t
F4
f
t
t
f
f
t
t
F5
f
f
f
t
f
t
t
Strimko By Resolution
CS360 Project 2
Strimko: The Puzzle Solving Strimko by Resolution
Strimko is a popular puzzle on an n n board, where apart from the n rows and columns, there are
n streams/chains each of length n, as shown in varying colors in Figure
CS360 Project 3
1
Bayesian Networks
From http:/aispace.org/bayes/ download the AIspace Belief and Decision
Networks Java applet. You might need to add http:/www.aispace.org/ to the
Exception Site List available in the Security tab of the Java Control
Pane
CS360 Project 1 A* Search for Pac-Man
1
Introduction
In this project, you will implement several functions to help the Pac-man1 agent
nd paths through his maze world, both to reach a particular state (location) and to
collect food eciently. You will build
CS360 Homework 10
Bayesian Networks
1) Consider the following Bayesian network, where F = having the u and C =
coughing:
P(F) = 0.1
F
C
P(C | F) = 0.8
P(C | F) = 0.3
a) Write down the joint probability table specied by the Bayesian network.
b) Determine t
CS360 Homework 1
Breadth-First and Depth-First Search
1) A 4-neighbor gridworld is given below. In which order do depth-rst search and
breadth-rst search (both with a sensible node pruning strategy) expand the
cells when searching from s to g? Ties are br
CS360 Homework 2
Informed Search
1) We are given a sequence of integers and want to sort them in ascending order.
The only operation available to us is to reverse the order of the elements in
some prex of the sequence. For instance, by reversing the rst t
CS360 Homework 3
Search
1) Solve Problem 1 from Homework 1 for A* with a) the (consistent) Manhattan
distance heuristic and b) the straight line distance heuristic. The Manhattan
distance heuristic between two grid cells (x1 , y1 ) and (x2 , y2 ) is |x1 x
CS360 Homework 4
Resolution with Propositional Logic
1) Consider the following popular puzzle. When asked for the ages of her three children, Mrs. Baker says that Alice is her youngest child if Bill is not her youngest
child, and that Alice is not her you
CS360 Homework 5
STRIPS
1) Formulate in STRIPS the planning problem of transforming the given start
conguration of the eight-puzzle to the given goal conguration. (In the eightpuzzle, the empty tile can be swapped with its North, South, East or West
neigh
CS360 Homework 8
Game Tree Search
1) What is the minimax value of the root node for the game tree below? Cross out
the node(s) whose value(s) the alpha-beta method never determines, assuming
that it performs a depth-rst search that always generates the le
CS360 Homework 7
Constraint Satisfaction
1) Consider the two formulations of the N-Queens problem as a constraint satisfaction problem from the slide set (Constraint Satisfaction, slides 5 and 6).
Compare these two formulations in terms of the size and br
CS360 Homework 6
Local Search
1) In the N -Queens problem, we want to place N queens on an N N board
with no two queens on the same row, column, or diagonal. Come up with a
value function and use hill climbing to try to solve the problem by minimizing
thi
CS360 Homework 11
Expectation Maximization
1) Similar to the example in our favorite textbook, assume that your favorite
Surprise candy comes in two avors: cherry and lime. The manufacturer has
a peculiar sense of humor and wraps each piece of candy in th
CS360 Homework 9
Probabilistic Reasoning
1) Consider the following joint probability table
PASSEXAM
t
t
f
f
WILDPARTY
t
f
t
f
0.1
0.2
0.3
0.4
Calculate:
P(PASSEXAM)
P( WILDPARTY)
P(PASSEXAM WILDPARTY)
P(PASSEXAM WILDPARTY)
P(PASSEXAM | WILDPARTY)
P(WILDPA
CS360 Homework 12
Value of Information
1) A mobile robot is trying to get from his current position A to a destination D
as quickly as possible. There is a river separating A from D and there are two
bridges, B and C, spanning the river. The robot must de
THESIS
Human computer interaction involves has a mix of planning, design using behavioral science
with computer science to highlight the interfaces between users and computers. The following
material highlights the progress in the field of human computer