 When: Tuesday & Thursday, 9:30  10:50p
 Where: ICS 174 UCI campus map
 Course Code: 34900
 Discussion section : Mon 12:001:50 DBH 1300.
 Optional. It purpose is to explore topics in more depth, to work on concrete examples, or to get help in understanding difficult parts of the material.
 Instructor: Kalev Kask
 Email: kkask@uci.edu; when sending email, put CS271 in the subject line
 TA: Koosha Azartash
 Reader: Rajesh Padgilwar
 Textbook
Course Overview
The goal of this class is to familiarize you with the basic principles of Artificial Intelligence.
Topics covered Include: Heuristic search, Adversarial search, Constraint Satisfaction Problems, Knowledge representation, Reasoning and Planning.
We will cover much of the content of chapters 110 in the course book.
Assignments:
There will be weekly homeworkassignments, a project, and a final.
CourseGrade:
Homeworks will account for 20% of the grade, project 30% of the grade, final 50% of the grade.
Project
You will be required to do a project. This includes submitting a written report at the end of the quarter :
 Due to the large number of students enrolled, each project will be a team project (34 stundents per team).
 Project involves writing a computer program to solve one of the following four problems :
 Nqueens :
input is an integer N;
output should be a sequence of integers (ranging [1,N]) of length N, containing a position of a queen in each column, left to right.
 (classic) Sokoban,
input is 5 lines defining the board :
 sixeH sizeV, e.g. "3 5"
 nWallSquares a list of coordinates of wall squares, e.g. "12 1 1 1 2 1 3 2 1 2 3 3 1 3 3 4 1 4 3 5 1 5 2 5 3"
 nBoxes a list of coordinates of boxes, e.g. "1 3 2"
 nStorageLocations a list of coordinates of storage locations, e.g. "1 4 2"
 playes initial locatin x and y, e.g. "2 2"
output is a single line, beginning with nMoves followed by a sequence of letters (U,D,L,R) indicating direction of the move, e.g. "1 D".
 16x16 (Hexadecimal) Sudoku :
input is a sequence of 256 numbers ranging [1,F], encoding the initial board position, lefttoright and topdown, with 0 for empty squares;
output should be a sequence of hex numbers ranging [0,F].
 Mastermind :
input is (a) number of colors and positions, (b) a response to each guess by the computer;
output is a series of guesses, each consisting of a color per position.
Each team needs to submit a written report (one report per team) at the end of the course (12/14/2017).
There will be a competition between teams solving the same problem; team with best performing program will get bonus points.
Teams should be formed and project proposals finalized/approved by early Nov at the latest.
Syllabus:
Subject to changes
Week 
Topic 
Date 
Reading 
Lecture 
Slides 
Homework 
Week 1 
 Introduction, History, Intelligent agents.

0928 
RN Ch. 1, 2 

Set 1


Week 2 
 Problem solving, state space, search space
 Uninformed search: BreadthFirst, Uniform cost, DepthFirst, Iterative Deepening

1003
1005 
RN Ch.3.13.4 

Set 2

Homework 1

Week 3 
 Informed heuristic search: BestFirst, Greedy search, A*.
 Informed heuristic search cont. Properties of A*. Branch and Bound, Iterative Deepening A*, generating heuristics automatically. Beyond classical search, AND/OR search.

1010
1012 
RN Ch.3.53.7 

Set 3

Homework 2

Week 4 
 Game playing: Adversarial search. Game tree, MINIMAX algorithm, evaluation function.
 Game playing: Alpha/Beta pruning, stochastic games.

1017
1019 
RN Ch. 4
RN Ch. 5 

Set 4

Homework 3

Week 5 
 Game playing cont.
 Constraint satisfaction problems: Formulation, Search.

1024
1026 
RN Ch. 6 

Set 5

Homework 4

Week 6 
 Constraint satisfaction problems cont.: Inference.
 Knowledge and Reasoning:
Logical agents, Propositional inference.

1031
1102 
RN Ch. 7 

Set 6


Week 7 
 Knowledge and Reasoning:
Propositional logic : inference.
 Knowledge representation:
Firstorder Logic.

1107
1109 
RN Ch. 8 

Set 7

Homework 5

Week 8 
 Firstorder Logic cont.
 Firstorder Logic cont.

1114
1116 
RN Ch. 9 

Set 8

Homework 6

Week 9 
 Classical Planning: Planning systems, propositionalbased, STRIPs planning.
 No class 1123 (holiday)

1121 
RN Ch. 10 

Set 9


Week 10 
 Classical Planning: Planning graphs, Planning as satisfiability and statespace search.
 Final 1130.

1128
1130 


Final Study Guide

Homework 7

Week 11 
 Project Presentations
 Project Presentations

1205
1207 


Project Report Guidelines


Week 12 
 Project Presentations 8:0010:00am

1214 




Resources on the Internet
Essays and Papers
