CS 6613
Exam 2 Topics
Fall 2013
E. K. Wong
Exam 2 will cover topics listed below. This will be a closed-book and closed-note exam. Please
bring a calculator (with basic functions), a pen, a pencil, and an eraser. Smart phones, tablets, and
notebook PCs ar
CS 6613
HW 3 Solution revised
Fall 2013
E K Wong
Total points = 45
1. [15 points] (a) 3 points, (b) 3 points, (c) 9 points.
(a) Define eight actions for moving the blank position - move left, move up left, move up, move
up right, move right, move down rig
CS 6613
HW 2
Fall 2013
E. K. Wong
Total points = 80.
1. [15 points] Is each of the following statements true? Why or why not?
(a) Breadth-first search is a special case of uniform-cost search.
(b) Breadth-first search, depth-first search, and uniform-cost
CS 6613
HW 8 Solution
Fall 2013
E. K. Wong
Total points = 80
1. [10 points] The following axiom is needed:
h, w Male(h) Spouse(h, w) Female( w) .
(This axiom is no longer true in certain countries and certain states in the US.)
2. [10 points] The wumpus w
CS 6613
HW 2 Solution
Fall 2013
E. K. Wong
Total Points = 80
1. [15 points] 5 points for each part.
(a) Uniform-cost search expands the lowest-cost node on the frontier. When all step
costs in the uniform-cost search are equal, all the frontier nodes at t
CS 6613
HW 4 Solution
Fall 2013
E K Wong
Total points = 40
1. [10 points]
2. [15 points]
1
CS 6613
HW 4 Solution
Fall 2013
E K Wong
3. [15 points] In the solution below, X represents black balls and O represents red balls.
The solution below is not unique
CS 6613
HW 1 Revised 9-21-2013
Fall 2013
E. K. Wong
Total points = 84.
1. [9 points] In the TREE-SEARCH and GRAPH-SEARCH algorithms, a linear array is used
to implement the FRONTIER data structure and the first node in the front of the FRONTIER
is chosen
CS 6613
HW 1 Solution
Fall 2013
E. K. Wong
Total Points = 84
1. [9 points] (3 points each) (a) LIFO queue (or stack) (b) FIFO queue (c) queue ordered in
increasing order of path cost.
(Alternate answer to part (b), if one of the searches is done by breadt
CS 6613
Fall 2013
HW 8
E. K. Wong
Total points = 80
1. [10 points] What axiom is needed to infer the fact Female (Laura) given the facts Male (Jim)
and Spouse (Jim, Laura)? Write your axiom in the form of a first-order-logic implication rule.
2. [10 point
CS 6613
Project: Interactive M,N,K (4,5,4) Game
Fall 2013
E. K. Wong
Total points = 100. Extra credits: up to a maximum of 25 points.
Project Description: Design and implement an Interactive M,N,K (4,5,4) Game for a person to
play against a computer. The
CS 6613
HW 5 Solution
Fall 2013
E K Wong
Total points = 22
1. [10 points] (a) Each queen has three successors (three possible moves in its column).
Therefore there are 4 x 3 = 12 successors. (b) The h value for each successor is as shown
below, with h equ
CS 6613
HW 6 Solution
Fall 2013
E K Wong
Total points = 65
1. [10 points] The domain for Q1, ., Q8 is cfw_1,2,.,8, which specifies the row position of
each queen. Assume that the row number of the bottom-most row is 1. The constraints between
two queens c
CS 6613
HW 7 Solution
Fall 2013
E. K. Wong
Total Points = 88
1. [15 points] Problem 7.1 in 3rd edition of the text book. Solution is on page 4 of this solution.
2. [8 points] (a) False (b) True (c) True (d) False
3. [10 points]
A B C KB
FFF
F
T
T
T
FFT
T
CS 6613
ARTIFICIAL INTELLIGENCE
Chapter 1: Introduction
What is AI?
Views of AI fall into four categories:
Thinking humanly Thinking rationally
Acting humanly Acting rationally
The textbook advocates "acting rationally"
1
Acting humanly: Turing Test
Turi
CS 6613
Reading List 1
Fall 2013
E. K. Wong
Reading assignments from text book: S. Russell and P. Norvig, Artificial Intelligence: A
Modern Approach, Prentice Hall, 3rd edition, 2010.
Chapter 1: (all sections)
Chapter 2: (all sections)
Chapter 3: (all sec
CS 6613 Artificial Intelligence
Course Outline
Fall 2013
E. K. Wong
Description: Artificial Intelligence (AI) is an important topic in computer science that
has many diversified applications. It addresses one of the ultimate puzzles human are
trying to so
CS 6613
Exam 1 Topics
Fall 2013
E. K. Wong
Exam 1 will cover topics listed below. The exam will be closed book and closed note. Please
bring a basic scientific calculator, a pen, a pencil and an eraser. Smartphones, tablet PCs, and
notebook PCs are not al
Chap 5: Adversarial Search
Games vs. search problems
"Unpredictable" opponent
specify a
move for every possible opponent reply
Time limits
unlikely to find optimal
solution, must approximate
Game tree (2-player,
deterministic)
Minimax
Perfect play for
Chapter 2: Intelligent Agents
Outline
Agents and environments
Rationality
PEAS (Performance measure,
Environment, Actuators, Sensors)
Environment types
Agent types
1
Agents
An agent is anything that can be viewed as
perceiving its environment throug
Chapter 4: Beyond
Classical Search
(part 1)
Local search and optimization
Previously: systematic exploration of search space
Path to goal is solution to problem
Yet, for some problems path is irrelevant.
E.g. 8-queens
Different algorithms can be used
Loca
Constraint Satisfaction
Problems
Chapter 6
9/18/2012
Chap 6 CSP's
1
Constraint satisfaction problems (CSPs)
Standard search problem:
state is a "black box any data structure that supports successor
function, heuristic function, and goal test
CSP:
state is
First-Order Logic
Chapter 8
Pros and cons of propositional
logic
Propositional logic is declarative
Propositional logic allows partial/disjunctive/negated
information
(unlike most data structures and databases)
Propositional logic is compositional:
m
Chapter 7: Logical
Agents
Knowledge Base
Knowledge Base : a set of sentences represented in a knowledge
representation language and represents assertions about the world.
tell
ask
Inference rule: when one ASKs questions of the KB, the answer
should follow
11/27/12
Learning from Observations
Chapter 18
Section 1 3
Inductive learning
Simplest form: learn a function from examples
f is the target function
An example is a pair (x, f(x)
Problem: find a hypothesis h
such that h f
given a training set of examples
Chap 3: Problemsolving and search
Problem-solving agent
Four general steps in problem solving:
Goal formulation
Problem formulation
Search
What are the successful world states
What actions and states to consider given the goal
Determine the possible seque
CS 6613
HW 3
Fall 2013
E. K. Wong
Total points = 45.
1. [15 points] Consider a variation of the 8-puzzle problem that consists of a 3 x 3 board with eight
numbered tiles and a blank space. A tile that is either vertically, horizontally, or diagonally adja
Fall 2013
CS 6613
HW 6
E. K. Wong
Total points = 65
1. [10 points] Formulate the 8-queen problem as a finite-domain binary Constraint
Satisfaction Problem (CSP). Let each column has exactly one queen and the variables Q1, Q2,
., Q8 represent the positions
CS 6613
HW 5
E. K. Wong
Fall 2013
Total points = 22 points
1.
[10 points] The Hill-Climbing search algorithm (Steepest Descent version) is used to solve
the 4-queen problem in Figure 1 below, where each queen is represented by the symbol *.
Let the object
CS 6613
Fall 2013
HW 7
E K Wong
Total points = 88
1. [15 points] Problem 7.1 in 3rd edition of the text book (corresponds to problem 7.2 in 2nd
edition of the text book.)
2.
[8 points] The truth table for a propositional logic knowledge base with symbols
CS 6613
HW 4
Fall 2013
E. K. Wong
Total points = 40
1.
[10 points] The Minimax algorithm is applied to generate the game tree as shown below
for a two-player game. Fill in the minimax value of the nonterminal nodes in the tree as
determined by the Minimax