Set 4: Game-Playing
ICS 271 Fall 2014
Kalev Kask
Overview
Computer programs that play 2-player games
game-playing as search
with the complication of an opponent
General principles of game-playing and search
game tree
minimax principle; impractical, bu
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 2
Due Tuesday 10/18
1. (10 points) Trace the operation of graph-search A applied to the problem of getting to Bucharest from Zerind using the straight-line distance
heuristic. That is, show the
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 5
Due Thursday November 10
1. (15) (Problem 7.7 from Russell and Norvig). Consider a vocabulary with only
four propositions, A, B, C and D. How many models (satisfying true/false
assignments) a
Set 4: Game-Playing
ICS 271 Fall 2016
Kalev Kask
Overview
Computer programs that play 2-player games
game-playing as search
with the complication of an opponent
General principles of game-playing and search
game tree
minimax principle; impractical, bu
Set 3: Informed Heuristic Search
ICS 271 Fall 2016
Kalev Kask
Basic search scheme
We have 3 kinds of states
explored (past) only graph search
frontier (current)
unexplored (future) implicitly given
Initially frontier=start state
Loop until found sol
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 7
Due Tuesday, November 22
1. (10) Define PDDL(STRIPS) operator schemata for the problem of putting on shoes
and socks and a hat and a shirt.
2. (10) Explain how backward search using regressio
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 1; RN Chapters 3.1-3.4
Due Tuesday, 10/11
1. (25 points) In the water-jug puzzle, we are given a 4 liter jug, named F our, and a 3liter jug, named T hree. Initially, F our and T hree are empty.
ICS 271
Fall 2015
Instructor : Kalev Kask
Homework Assignment 4
Due Tuesday 11/3
1. (15 points) Consider the crossword puzzle
We represent the problem as a CSP where there is a variable for each
of the positions where a word is supposed to go (1-across, 2
ICS 271
Fall 2015
Instructor : Kalev Kask
Homework Assignment 3
due Tuesday, October 27
1. (25 points) Consider a Tic-Tac-Toe game. Let Xn be the number of rows, columns
or diagonals containing exactly n Xs and no Os. Similarly, let On be the number
of ro
ICS 271
Fall 2015
Instructor : Kalev Kask
Homework Assignment 1; RN Chapters 3.1-3.4
Due Tuesday, 10/13
1. (15 points) The three-disc Tower-of-Hanoi has three pegs A, B, and C, on which can
be placed three discs (Labeled D3, D2, D1) with holes in their ce
Preparing for the Final
Nov 24, 3:30-4:50, ICS 174
Kalev Kask
ICS 271
Fall 2015
271-fall 2015
Basics
1:20 minutes
closed-book
1 (one) sheet of A4 size paper of notes
Material Covered
Chapters 3-10
Search
Games
Constraint Satisfaction
Propositional
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 3
due Tuesday, October 25
1. (25 points) Consider a Tic-Tac-Toe game. Let Xn be the number of rows, columns
or diagonals containing exactly n Xs and no Os. Similarly, let On be the number
of ro
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 6
Due Thursday November 17
1. (20) Problem 8.23 in RN.
2. (15) Say whether or not the following pairs of expressions are unifiable, and show the
most general unifier for each unifiable pair:
(a
ICS 271
Fall 2016
Instructor : Kalev Kask
Homework Assignment 4
Due Thursday 11/3
1. (15 points) Consider the crossword puzzle
We represent the problem as a CSP where there is a variable for each
of the positions where a word is supposed to go (1-across,
Set 2: State-spaces and Uninformed
Search
ICS 271 Fall 2014
Kalev Kask
271-fall 2014
Problem-Solving Agents
Intelligent agents can solve problems by searching a state-space
State-space Model
the agents model of the world
usually a set of discrete state
Introduction to Artificial
Intelligence
Kalev Kask
ICS 271
Fall 2014
http:/www.ics.uci.edu/~kkask/Fall-2014 CS271/
271-fall 2014
Course requirements
Assignments:
There will be weekly homework assignments, a project, a final.
Course-Grade:
Homework will
Set 6: Knowledge Representation:
The Propositional Calculus
ICS 271 Fall 2014
Kalev Kask
Outline
Representing knowledge using logic
Agent that reason logically
A knowledge based agent
Representing and reasoning with logic
Propositional logic
Syntax
S
Set 7:
Predicate logic and inference
ICS 271 Fall 2014
Outline
New ontology
objects, relations, properties, functions
New Syntax
Constants, predicates, properties, functions
New semantics
meaning of new syntax
Inference rules for Predicate Logic (F
Project Report Guidelines
Written report due Dec 16, 10:30
Kalev Kask
ICS 271
Fall 2014
271-fall 2014
Programming Project
Grading is based on
Quality of work
Quality of report
Length : 5-10 pages, not including supporting materials
Do not print suppo
Preparing for the Final
Dec 16, 10:30-12:30, HG 1800
Kalev Kask
ICS 271
Fall 2014
271-fall 2014
Basics
2 hours
closed-book
1 (one) sheet of A4 size paper of notes
Material Covered
Chapters 3-10
Search
Games
Constraint Satisfaction
Propositional Lo
Set 8:
Inference in First-order logic
ICS 271 Fall 2014
Chapter 9: Russell and Norvig
Universal instantiation (UI)
Every instantiation of a universally quantified sentence is entailed by it:
v
Subst(cfw_v/g, )
for any variable v and ground term g
E.g., x
Set 2: State-spaces and Uninformed
Search
ICS 271 Fall 2014
Kalev Kask
271-fall 2014
Problem-Solving Agents
Intelligent agents can solve problems by searching a state-space
State-space Model
the agents model of the world
usually a set of discrete state
Introduction to Artificial
Intelligence
Kalev Kask
ICS 271
Fall 2014
http:/www.ics.uci.edu/~kkask/Fall-2014 CS271/
271-fall 2014
Course requirements
Assignments:
There will be weekly homework assignments, a project, a final.
Course-Grade:
Homework will
Set 3: Informed Heuristic Search
ICS 271 Fall 2015
Kalev Kask
Basic search scheme
We have 3 kinds of states
explored (past) only graph search
frontier (current)
unexplored (future) implicitly given
Initially frontier=start state
Loop until found sol
Project Report Guidelines
Written report due Dec 8, 4:00pm
Kalev Kask
ICS 271
Fall 2015
271-fall 2015
Programming Project
One report per team
Grading is based on
Quality of work
Quality of report
Length : 5-10 pages, not including supporting material
Set 7:
Predicate logic
Chapter 8 R&N
ICS 271 Fall 2015
Outline
New ontology
objects, relations, properties, functions
New Syntax
Constants, predicates, properties, functions
New semantics
meaning of new syntax
Inference rules for Predicate Logic (F
Set 6: Knowledge Representation:
The Propositional Calculus
Chapter 7 R&N
ICS 271 Fall 2015
Kalev Kask
Outline
Representing knowledge using logic
Agent that reason logically
A knowledge based agent
Representing and reasoning with logic
Propositional
Set 8:
Inference in First-order logic
ICS 271 Fall 2015
Chapter 9: Russell and Norvig
Universal instantiation (UI)
Every instantiation of a universally quantified sentence is entailed by it:
v
Subst(cfw_v/g, )
for any variable v and ground term g
E.g., x
Set 2: State-spaces and Uninformed
Search
ICS 271 Fall 2015
Kalev Kask
271-fall 2015
You need to know
State-space based problem formulation
State space (graph)
Search space
Nodes vs. states
Tree search vs graph search
Search strategies
Analysis of
Introduction to Artificial
Intelligence
Kalev Kask
ICS 271
Fall 2015
http:/www.ics.uci.edu/~kkask/Fall-2015 CS271/
271-fall 2015
Course requirements
Assignments:
There will be weekly homework assignments, a project, a final.
Course-Grade:
Homework will