Current Announcements:
· The answer key to the Final Exam is now posted below and here.
·
A prototype C++ Tournament shell has been
released. It is available at the following code repository:
https://github.com/Hydrotoast/ConnectK
Normally I protect student privacy very carefully, but
this student has volunteered to make his email address publicly available:
gborje@uci.edu
so that you can contact him directly with issues and observations, bugs and bug
fixes (if you contact him, please note that his name is Gio).
·
A prototype Java Tournament shell has been
released. Normally I protect
student privacy very carefully, but this student has volunteered to make the
code link on his home page publicly available:
http://www.ics.uci.edu/~avanbusk/connectK/
so that update files can be propagated immediately. He also has
volunteered to make his email address publicly available:
avanbusk@uci.edu
so that you can contact him directly with issues and observations, bugs and bug
fixes (if you contact him, please note that his name is Alex).
· The due date for the Project and the Tournament is Friday midnight, 7 December.
· The answer key to CS-171 Quiz #4 is now posted below and here.
· A detailed grading rubric for the Connect-K programming project has been inserted into the Project Specification and is available below and here.
· The answer key to CS-171 Quiz #3 is now posted below and here.
· The answer key to CS-171 Mid-term Exam is now posted below and here.
· A Project Specification for the Connect-K programming project is available here. A detailed grading rubric will be released shortly.
· My office hours on Thursday, 1 November, will end at 1:30pm in order to attend the lecture by Dr. Waleed Abdalati, Chief Scientist, NASA, sponsored by the UCI Office of Research (see announcement).
· The answer key to CS-171 Quiz #2 is now posted below.
· The answer key to CS-171 Quiz #1 is now posted below.
· There are now two CS-171 MessageBoard forums at EEE:
(1) Class Discussion; and
(2) Seeking project programming team partner. (Please use this forum if you are seeking a programming team partner for the class project.)
· You are *required* to form project teams of two students, following the “Pair Programming” paradigm. It is not possible to have one-person project teams.
· As stated in lecture and on the class website, the textbook is required. You will be at a serious disadvantage for quizzes and exams if you do not have the textbook as a study aid. Please be sure you have Russell & Norvig, 3rd ed. (the blue one).
· Current announcements will appear here, at top-level, for quick and easy inspection.
The
course is based on, and the UCI bookstore has, the 3rd edition. The
assigned textbook reading is required, and is fair game for quizzes and
exams. You
place yourself at a distinct disadvantage if you do not have the textbook. I expect that you have a personal copy
of the textbook, and quizzes and exams are written accordingly.
Please
purchase or rent your own personal textbook for the quarter (and then resell it
back to the UCI Bookstore at the end if you don't want it for reference).
Please do not
jeopardize your precious educational experience with the false economy of
trying to save a few dollars by not having a personal copy of the textbook.
The 3rd
edition is required. R&N
estimates that about 20% of the material in the 3rd edition is new
from the 2nd edition.
Several of the chapters and exercises have been rearranged.
(A kind and helpful student
has elucidated some of the differences between the 2nd & 3rd
editions; click here.)
Also,
for your convenience, I have requested that a copy of the textbook be placed on
reserve in the UCI Science Library. There is a two-hour check-out limit. However,
please understand that with high student enrollments, it is unrealistic to
expect that these thin reserves will always be available when you need
them. Please
purchase or rent your own personal textbook.
I do
deplore the high cost of textbooks.
You are likely to find the book cheaper if you search online at
EBay.com, Amazon.com, and related sites.
A student
kindly contributed the following suggestion, for which I cannot vouch, and
which I provide for your use if it is useful to you:
Hello,
I just wanted to point out that there does exist an
international edition of the book which can be bought for around $40-50. I
cannot comment on what specific differences there are for this particular book,
though they are usually very small (exercises moved around, etc).
Obviously, it is in paperback.
http://www.valorebooks.com/affiliate/buy/siteID=e79mzf/ISBN=0136042597
http://www.abebooks.com/servlet/BookDetailsPL?bi=4161131466&cm_ven=sws&cm_cat=sws&cm_pla=sws&cm_ite=4161131466&afn_sr=para¶_l=1
http://www.biblio.com/books/360025589.html
Personally I plan on using this book for a while so I bought the hardcover
version, but I just wanted to point out that this is an option for those
looking for a more 'economical' route.
~ XXXXXX [name anonymized to protect student privacy]
The following represents a preliminary syllabus. Some changes in the lecture
sequence may occur due to earthquakes, fires, floods, wars, natural disasters,
unnatural disasters, or the discretion of the instructor based on class
progress.
Background Reading and Lecture Slides will be changed or revised as the
class progresses at the discretion of the instructor. Please note: I may tweak or revise the lecture slides
prior to the lecture; please ensure that you have the current version.
Please read the assigned textbook reading in
advance of each lecture, then again after each
lecture.
Week 1:
Thu., 27 Sep.,
Introduction, Agents.
Read
in Advance: Textbook Chapters 1-2.
Lecture
slides: Introduction, Agents [PDF; PPT].
Optional Cultural Interest:
IBM Watson: Final Jeopardy! and the Future of Watson
AI vs. AI.
Two chatbots talking to each other.
Optional
Reading:
John
McCarthy, “What
Is Artificial Intelligence?”
HTML
and other versions of “What is AI?”
Optional
URL:
Association for the
Advancement of Artificial Intelligence (AAAI)
AAAI’s
digital library of more than 10,000 AI technical papers
Tue., 2 Oct., Uninformed Search.
Read
in Advance: Textbook Chapter 3.1-3.4.
Lecture
slides (three parts):
(1)
Introduction to Search [PDF; PPT];
(2)
Representation [PDF; PPT];
and
(3)
Uninformed Search [PDF; PPT].
Optional Cultural Interest:
Boston Dynamics Big Dog (new
video March 2008)
Optional Reading:
Newell & Simon’s “Symbols and Search” Turing
Award Lecture (1976).
Herbert
Simon was awarded a Nobel Prize (in economics, 1978).
Week 2:
Thu., 4 Oct.,
Heuristic Search.
Read
in advance: Textbook Chapter
3.5-3.7.
Lecture
slides: Heuristic Search [PDF; PPT].
Optional
Cultural Interest:
Infinite Mario AI - Long
Level
An attempt at a Mario AI using the A* path-finding algorithm.
It
claims the bot won both Mario AI competitions in 2009.
“You
can see the path it plans to go as a red line, which updates when it detects
new obstacles at the right screen border. It uses only information visible on
screen.”
See
also http://www.marioai.org/.
Tue., 9 Oct., Local Search.
Read in advance: Textbook Chapter 4.1-4.2.
Lecture
slides: Local Search [PDF; PPT].
Optional URL:
The
program learns to build a car using a genetic algorithm
Optional
Reading:
Minton,
et. al., 1990, AAAI "Classic
Paper" Award recipient in 2008.
How to solve the 1 Million Queens problem and schedule space
telescopes.
Optional
Lecture Slides:
Optional Ungraded Homework:
Week 3:
Thu., 11 Oct., Quiz #1 (answer key here);
start Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.1-5.5.
Lecture
slides: Games/Adversarial Search [PDF; PPT].
Optional Cultural Interest:
Optional
Reading:
Campbell, et al., 2002, Artificial
Intelligence, “Deep Blue.” [PDF]
(URL
http://www.sciencedirect.com/science/article/pii/S0004370201001291)
Tue.,
16 Oct., finish Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.1-5.5.
Lecture
slides: Games/Adversarial Search (above).
Optional Cultural Interest:
Arthur
C. Clarke “Quarantine.”
A science fiction short story written by a classic master, in 188
words.
He
was challenged to write a science fiction short story that would fit on a postcard.
Optional Reading: Chaslot, et al.,
“Monte-Carlo
Tree Search: A New Framework for Game AI,”
in Proceedings
of the Fourth Artificial Intelligence and Interactive Digital Entertainment
Conference,
AAAI Press, Menlo Park, pp. 216-217, 2008.
An interesting combination of Local Search (Chapter 4) and Game
Search (Chapter 5).
Optional URL: “Everything
Monte Carlo Tree Search” website.
Optional Ungraded Homework:
Week 4:
Thu., 18 Oct.,
start Constraint Satisfaction.
Read in advance: Textbook
Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Satisfaction Problems [PDF;
PPT].
Special Announcement:
ICS Faculty Panel On Improving Your Graduate School Application
Optional Cultural Interest:
Google Car: It Drives Itself
- ABC News
[Part 1/3] The Evolution of
Self-Driving Vehicles
[Part 2/3] How Google's
Self-Driving Car Works
[Part 3/3] Google's
Self-Driving Golf Carts
DARPA Urban Challenge Highlights
Princeton
DARPA Grand Challenge - Crash Video
DARPA Urban Challenge: Ga Tech hits curb
DARPA Urban Challenge - Sting
Racing crash
[DARPA] Team Oshkosh attempts
forced Entry to Main Exchange
[DARPA] Alice's Crash
(spectator view)
[DARPA] Alice's Crash
(road-finding camera) [different view of above; long]
DARPA Urban Challenge Crash
Cornell MIT
DARPA Urban Challenge - robot
car wreck [different view of above]
Optional
Reading:
Autonomous car - Wikipedia,
the free encyclopedia
“Autonomous
Driving in Traffic: Boss and the Urban Challenge” (2009).
“Stanley: The
Robot that Won the DARPA Grand Challenge” (2005).
Tue.,
23 Oct., finish Constraint Satisfaction.
Read
in advance: Textbook Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Satisfaction Problems (above).
Optional
Cultural Interest:
RoboCup
2012 Standard Platform: USA / Germany (Final).
Optional
Ungraded Homework:
Week 5:
Thu., 25 Oct., Quiz #2 (answer key here);
start Propositional Logic.
Read in advance: Textbook
Chapter 7.1-7.4.
Lecture
slides: Propositional Logic A [PDF; PPT].
Optional
Cultural Interest: “Freaky
AI robot, taken from Nova science now”
Tue.,
30 Oct., finish Propositional Logic.
Read in advance: Textbook
Chapter 7.5-7.8.
Lecture slides:
Propositional Logic B [PDF; PPT].
Additional Discussion lecture slides [PDF;
PPT].
Optional
pre-Halloween URLs (snakes and spiders!):
“Asterisk - Omni-directional
Insect Robot Picks Up Prey #DigInfo”
Optional Reading:
Alan
Turing’s classic paper on AI (1950).
(URL
http://www.loebner.net/Prizef/TuringArticle.html)
Alan
Turing is the most famous computer scientist of all time.
The Turing Award is the
highest honor in computer science.
The Turing Machine is
still our fundamental theoretical model of computation.
Turing’s work on the
Enigma code in WWII led to programmable computers.
AAAI/AI
Topics: The Turing Test:
“Can Machines Think?”
Wikipedia
“Computing
Machinery and Intelligence”
No
homework --- study for the Mid-term Exam.
Week 6:
Thu., 1 Nov., Catch-up, Review for Mid-term Exam.
Read in advance: Textbook
Chapters 1-7 (only sections assigned above).
Lecture
slides: Catch-up, Review, Question&Answer
[PDF;
PPT].
NOTE: My office hours on
Thursday, 1 November, will end at 1:30pm in order to attend the lecture by Dr. Waleed Abdalati, Chief Scientist,
NASA, sponsored by the UCI Office of Research (see announcement).
Tue., 6 Nov., Mid-term Exam (answer key
here).
Read in advance: Textbook
Chapters 1-7 (only sections assigned above).
Lecture
slides: Catch-up, Review, Question&Answer
(above).
Optional Ungraded Homework:
Week 7:
Thu., 8 Nov., Review Mid-term Exam; start First Order Logic
Read in advance: Textbook
Chapter 8.1-8.2.
Lecture
slides: First Order Logic Syntax [PDF; PPT].
Optional
Cultural Interest:
“Singularity
Institute for Artificial Intelligence- P1/2 - Video Dailymotion”
“Singularity Institute for
Artificial Intelligence”
“Singularity
Institute - Wikipedia, the free encyclopedia”
Singularity Institute home page
Tue., 13 Nov., finish First Order Logic; Knowledge Representation.
Read in advance: Textbook
Chapter 8.3-8.5.
Lecture slides (two parts):
(1) First Order Logic Semantics [PDF; PPT];
and
(2) First Order Logic
Knowledge Representation [PDF;
PPT].
Optional
Cultural Interest:
Optional
Reading:
Ferrucci, et al., 2010, “Building Watson: An Overview of the DeepQA Project”
(URL
http://www.stanford.edu/class/cs124/AIMagazine-DeepQA.pdf)
Optional Ungraded Homework:
Week 8:
Thu., 15 Nov., Quiz #3 (answer key here); Inference in First Order Logic.
Read in advance: Textbook
Chapter 9.1-9.2, 9.5.1-9.5.5.
Lecture
slides: First Order Logic Inference [PDF; PPT].
Optional
URL: “Peter Norvig
12. Tools of AI: from logic to probability.”
Tue., 20 Nov., Probability, Uncertainty, Bayesian Networks.
Read in advance: Textbook
Chapters 13, 14.1-14.2.
Lecture
slides: Reasoning Under Uncertainty [PDF;
PPT].
Optional
Cultural Interest:
“IBM
simulates 530 billon neurons, 100 trillion synapses on supercomputer”
“Speech Recognition Breakthrough for the Spoken, Translated Word”
Optional
Reading:
Searching for Commonsense: Populating Cyc from the Web, Matuszek et al, AAAI 2005
(URL
http://www.cyc.com/doc/white_papers/AAAI051MatuszekC.pdf)
Optional Reading: An Introduction to the Syntax and Content of Cyc, Matuszek et al, AAAI Spring Symposium, 2006
Optional Ungraded Homework:
Week 9:
Thu., 22 Nov., Thanksgiving Day Holiday
Tue., 27 Nov., start Learning from Examples.
Read in advance: Textbook
Chapter 18.1-18.4.
Lecture slides: Intro to Machine Learning [PDF; PPT].
Week 10:
Thu., 29 Nov., Quiz #4 (answer key here); finish Learning from Examples.
Read in advance: Textbook
Chapter 18.5-18.12, 20.1-20.3.2.
Lecture slides:
Learning Classifiers [PDF; PPT].
Tue., 4 Dec., Machine Learning
& Machine Vision (lecture
by Dennis Park).
Read in advance: TBA.
Lecture slides:
TBA
[PDF; PPT].
Viola & Jones, Learning, Boosting, Vision [PDF; PPT] (read the paper immediately below!)
Optional
Reading: Viola
& Jones, 2004, “Robust Real-Time Face Detection”
Optional
Reading: Freund
& Schapire, 1999, “A Short Introduction to
Boosting”
Optional Reading: Danziger, et al., 2009, “Predicting Positive p53 Cancer Rescue Regions Using Most Informative Positive (MIP) Active Learning”
Week 11:
Thu., 6 Dec., Catch-up, Review for Final Exam.
Read in advance: Textbook,
review all assigned reading.
Lecture
slides: Review, Catch-up, Question&Answer [PDF; PPT].
Fri., 7 Dec., Project due (Friday midnight): Alpha-Beta Search with Heuristic Cut-off
Final Exam:
Tue., 11 Dec, 10:30am-12:30pm Final Exam (answer key here).
Connect-K Game. This project corresponds to Game Search
(Chapter 5 in your book). Your job is to write an AI agent that can beat you at
Connect-K, i.e., to write the adversarial search (“game search”)
controller for a video game world.
A Project Specification for the Connect-K programming project is
available here. A detailed grading rubric has been
released as part of the Project Specification.
A Java shell is
available; a C++ shell is
available; an
example “dumb” game is available; an
example “smart” game is available. A student has kindly
contributed the Java packages for the term project game and put them together
into a jar file (available here).
Another student has kindly written a Java application for use with the term
project game, from scratch, using Swing (available
here).
·
A prototype C++ Tournament shell has been released.
It is available at the following code repository:
https://github.com/Hydrotoast/ConnectK
Normally I protect student privacy very carefully, but
this student has volunteered to make his email address publicly available:
gborje@uci.edu
so that you can contact him directly with issues and observations, bugs and bug
fixes (if you contact him, please note that his name is Gio).
·
A prototype Java Tournament shell has been
released. Normally I protect
student privacy very carefully, but this student has volunteered to make the
code link on his home page publicly available:
http://www.ics.uci.edu/~avanbusk/connectK/
so that update files can be propagated immediately. He also has
volunteered to make his email address publicly available:
avanbusk@uci.edu
so that you can contact him directly with issues and observations, bugs and bug
fixes (if you contact him, please note that his name is Alex).
There is also a “tournament” shell that was begun by the
undergraduate working on the Game code (available here), but he
graduated before it was finished.
Another tournament small framework, written by another student, is available here, and
as a zip file here.
I will offer extra credit to any students who are interested in playing a
“tournament” and get that code working. I will also offer CS-199 credit to any
student who wishes to do this as an independent study in the future (grade of
A- or better required).
All of my various CS-171 projects were written by former CS-171 students
who became interested in AI and signed up for CS-199 in order to pursue their
interest and write interesting AI project shells. Please let me know if this is of
interest to you (grade of A- or better required).
Previous
CS-171 Quizzes, Mid-term exams, and Final exams are available here as study
guides.
As an
incentive to study this material, at least one question from a previous Quiz or
Exam will appear on every new Quiz or Exam. In particular, questions that many
students missed are likely to appear again. If you missed a question, please
study it carefully and learn from your mistake --- so that if it appears again,
you will understand it perfectly.
Fall Quarter
2012:
Mid-term
Exam and key
Final
Exam and key
Winter
Quarter 2012:
Mid-term
Exam and key
Final
Exam and key
Spring
Quarter 2011:
Mid-term
Exam and key
Final
Exam and key
Spring
Quarter 2004:
Spring
Quarter 2000:
Additional Online Resources may be posted as the class progresses.
Academic dishonesty is unacceptable and will not be
tolerated at the University of California, Irvine. It is the responsibility of
each student to be familiar with UCI's current academic honesty policies.
Please take the time to read the current UCI
Senate Academic Honesty Policies and the ICS School
policy on cheating.
The policies in these documents will be adhered to scrupulously. Any student who engages in cheating, forgery, dishonest conduct, plagiarism, or collusion in dishonest activities, will receive an academic evaluation of ``F'' for the entire course, with a letter of explanation to the student's permanent file. The ICS Student Affairs Office will be involved at every step of the process. Dr. Lathrop seeks to create a level playing field for all students.