v 20 Mar 2016:
The Final Exam key has been posted below and is available here.
v 11 Mar 2016: The Monster Sudoku Final Report Template has been
revised to clarify the distinction between completable
and solvable, and the new version is available here.
v
10Mar2016: The Quiz #4 answer key has been posted
below and is available here.
v
10Mar2016: Google's AlphaGo
has won the first two games of a 5-game $1M Go match in Korea against Lee Sedol (9-dan pro), the top Go player of the past decade.
https://gogameguru.com/alphago-2/
http://www.nbcnews.com/tech/tech-news/go-match-between-lee-sedol-alphago-push-ai-boundaries-n533821
http://www.wired.com/2016/03/googles-ai-wins-first-game-historic-match-go-champion/
https://deepmind.com/alpha-go.html
You are watching AI history being made before your eyes. Go was the last
major board game at which human champions could beat computers. It was
widely believed to be at least a decade before a computer could beat the human
champion.
v
10Mar2016: In response to student feedback and
requests:
(1)
The Final Report deadline is extended to Wednesday, 16 Mar, 11:59pm.
(2)
We realize that some student projects have difficulty in scaling to N>9, so
for them we will put less grading weight on Parts 4&5. Student projects that do scale well to
N>9 may get extra credit, at our sole discretion.
(3)
If you are unable to solve “hard” puzzles at N=9 and so cannot do
Parts 2-4, then use N=8 or N=6 in Part 2 and work up from there doing the best
you can. Please be sure to notate this exception in your comments.
v
3 Mar 2016: The Monster Sudoku Final Report Template
has been posted below and is available here.
v
1 Mar 2016:
The tester program has been removed because it has been replaced by the grader
program. Teams that deposit their code in EEE DropBox
by midnight, Friday, 4 March, will have their code run through the grader
program and be notified of any errors by Saturday morning. Contact the TA, Junkyu Lee, with any questions.
v
25Feb2016:
The Quiz #3 answer key has been posted below and is available here.
v
16Feb2016:
The Project deadlines have been extended to give you more time to code. (1) The Forward Checking
deadline has been extended to next Sunday, 21 Feb, and will be regraded. Please fix any problems with your code
and resubmit if needed. (2)
The AC-3/ACP/MAC part has been made optional
for extra credit. (3)
The MRV/DH part has been extended to Sunday, 6 March, and combined with the LCV
deadline.
v
11Feb2016:
The Mid-term Exam key has been posted below and is available here.
v
11Feb2016:
Thanks to the good efforts of Junkyu Lee, the TA, a revised
and more detailed the Sudoku Project Assignments document is available here.
v
9Feb2016:
The Midterm exam will cover chapters 1-6 in your textbook.
v
9Feb2016:
Marvin Minsky, one of the early pioneers of AI, has passed away recently (e.g.,
see here and here).
v
6Feb2016:
Thanks to the good efforts of Minhaeng Lee, the
Reader, we have updated the Quiz #2 key to include the approximate percentage
and number of students who scored Perfect, Partial, and Zero on each question
(available here
and in the Study Guides section below).
v
3Feb2016:
Thanks to the good efforts of Minhaeng Lee, the
Reader, we have released a revised Testing Shell v.0.2 (available here, and
also in the Project section below). This testing
shell should accommodate your Sudoku solver.
Minhaeng 's fervent hope is that you will
discover all of the problems with the testing shell quickly, and report them to
him promptly, so that he may fix them and improve your experience. Please send feedback email to
minhaenl@uci.edu, and CC me when you do so.
Because
we did not provide the promised testing shell for your code prior to the due
date, and since many of your programs had problems, the CS-171 Teaching Staff
after discussion has decided to treat this assignment very gently and
charitably. Provided that you
turned in something that was binary, source, and documentation, you will not be
penalized if your code did not work in our scripts,
because it is partially our fault since you were not provided with the promised
testing shell.
**** You are
responsible for fixing your code so that on the *next* assignment it runs
correctly in our scripts (= it runs correctly in the current released Testing
Shell). Otherwise, you will lose
points on the *next* assignment.
v
3Feb2016:
The answer key to Quiz #2 has been posted below and also is available here.
v
28Jan2016:
Thanks to the good efforts of Minhaeng Lee, the
Reader, a test shell to validate your programs on openlab
is available here.
This shell is only for testing whether student's program is runnable on the openlab environment. Note that, currently, the testing
shell doesn't contain tests for whether or not the output is correct. We will
update later.
v
28Jan2016:
Thanks to the good efforts of Junkyu Lee, the TA, a
detailed description of exactly what to turn in for your Sudoku Project
Assignments is available here. It will be updated as we go along. Please
note that we are still discussing what to do about the Generator portion of the
project, which was canceled (see below) because the provided Java shell
included a generator. However, apparently some students have written their own
generator anyway. Most likely we will give extra credit for extra work; but the
matter is still under discussion. In the meantime, it is OK if your program
accepts the GEN and BT option tokens, even if they do not appear in the current
description.
v
28Jan2016:
A former CS-171 student has shared some news that you may find of interest.
Related
links, which you may find of interest (you must access the links below from
within your UCI login or Nature may try to charge you for them):
Ø
Nature
| Editorial: Digital
intuition: A computer program that
can outplay humans in the abstract game of Go will redefine our relationship
with machines.
Ø
Nature
| News: Google
AI algorithm masters ancient game of Go:
Deep-learning software defeats human professional for first time.
Ø
Nature
| Article: Mastering
the game of Go with deep neural networks and tree search
v
Every
project team, including
students who code in Java, must turn in the Backtracking Search
assignment by Sunday, 31 Jan. Erroneously, an
announcement below (now canceled) previously said that “For students who
code in Java, *nothing* will be due on Sun., 31 Jan.” We later realized
that even students who code in Java must submit code and executables that
function correctly under our project scripts.
v
In
order to make the Project more fair to students who code in Python or C++, the
CS-171 Teaching Staff has decided to offer Extra Credit points to any student
who writes their own project shell without using or copying code from the Java
shell provided (it is OK to look at it for ideas, but not to copy it directly).
In order to be fair, this offer is available to all students, including those
who prefer to code in Java. The exact amount of Extra Credit will be decided
and posted to EEE GradeBook shortly.
v
EEE
DropBoxes for your project assignments are now
available. Please follow the file format and naming conventions stated below.
v
The
Syllabus part of the class website has been reorganized to be more user-friendly
and easier to navigate. For each week, material has been grouped and ordered
as: Lecture Slides, Discussion Slides, Project Deadlines, Optional Homework,
Optional Reading, and Optional Cultural Interest.
v
The
quiz #1 key has been posted below and is available here.
v
A
description of what to turn in for your first assignment is available here.
It currently covers Backtracking Search (due Sun., 31 Jan., 11:59pm), and will
be expanded as we go along.
v
Sun., 24 Jan., 11:59pm: DEADLINE CANCELLED --- SEE CLASS EMAIL. *NOTHING* IS DUE THIS SUN., 24 JAN.
Project Problem Generator Deadline.
You will lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
v
I
have revised the class website to cancel the Sun., Jan. 24, deadline. The Java coding shell that was provided
has rendered the generator unnecessary, even for students who prefer C++ or
Python.
I
am and remain embarrassed that there is a Java shell but no C++ nor Python shell (which are expected to be written this
quarter by former CS-171 students who scored A- or better).
Nevertheless,
upon discussion, the CS-171 Teaching Staff (the TA, Reader, and I) became
worried about the possibly excessive workload if we made you code *everything*
from scratch with no guidance whatsoever.
In
the end, our worries about a possibly excessive workload outweighed our
concerns that releasing a Java-only coding shell would favor students who
preferred Java. It became yet
another engineering trade-off, and concerns about excessive workload became
more important.
For
students who prefer C++ or Python, please recognize that your task has been
greatly simplified by the release of the Java shell. Even if you do not prefer
Java, surely you can read it, and porting/translating existing code is always
easier than writing it from scratch.
**** For students
who code in C++ or Python, I apologize that your ported/translated backtracking
search working code still will be due on
Sun., 31 Jan., 11:59pm. The
reason is so that you do not fall behind in your coding project. Your submitted code should be
essentially a port/translation of the provided Java backtracking search
shell. I apologize that I have only
a Java shell now; but it is what I have do now, and porting/translating it will
move you greatly forward relative to the workload of coding it from scratch.
For
students who code in Java, *nothing* will be due on Sun., 31 Jan., 11:59pm,
because the shell provides it all.
Please do not rest on your laurels.
Instead, please use this time to get further ahead in your project.
All
remaining Project deadlines will persist unchanged. The TA and the Reader (Junkyu Lee and Minhaeng Lee) are
in charge of the Project, and shortly will release relative weights of the
several Project components.
v
The
CS-171 Teaching Staff discussed the Project and decided to release a Java
coding shell for Sudoku. I do not yet have C++ or Python shells (they will be
written this quarter), and it has never been tested by “live” use
in a CS-171 class. In spite of these limitations, we thought it might be
helpful to you as an example.
v
The
CS-171 Teaching Staff discussed Project grading and decided to temper justice
with mercy. You will lose 10% of your Project grade for every day it is late,
pro-rated for fractional days and rounded up to the nearest integer percentage
point above. (Previously, you lost 10% for every day or fraction thereof that
it was late.)
v
The
Google form (http://goo.gl/forms/YLixJ7ep5j) REPLACES the EEE DropBox
that was previously mentioned.
Please deposit your team information in the Google form AND NOT in the EEE DropBox.
v
Merged with Sudoku Project Assignments
(above). A
Specification for your Monster Sudoku problem Reader and Generator is available
here.
v
Please
submit your team information to the following Google form.
http://goo.gl/forms/YLixJ7ep5j
1)
As announced, the submission is due by upcoming Friday, Jan 15th, 23:59 PM.
2)
It is okay to submit your team information ONCE.
NO SPACES, NOR ANY OTHER
UNIX SPECIAL CHARACTER,
in yourTeamName. They break our scripts and waste
time and effort. You may lose points if yourTeamName
breaks our scripts. You are guaranteed to be safe if yourTeamName
contains no spaces nor any other Unix special
character. Letters, numbers, hyphens, and underscores are safe.
v
A
slideshow about the Monster Sudoku coding project is available here. More information will be posted shortly.
v
There
is an EEE CS-171 MessageBoard forum "Seeking
CS-171 Coding Project Partner" intended for use by students who seek a
project partner.
v
There
is an EEE CS-171 MessageBoard forum “Class
Material Discussion” intended for use by students who wish to discuss the
class material.
v Current
announcements will appear here, at top-level, for quick and easy inspection.
·
Fri.,
15 Jan., 11:59pm: Project Team Formation Deadline.
You will lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
·
Tue., 19 Jan.: Quiz #1.
·
Sun., 24 Jan., 11:59pm: DEADLINE CANCELLED --- SEE CLASS EMAIL. *NOTHING* IS DUE THIS SUN., 24 JAN.
Project Problem Generator Deadline.
You will lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
·
Sun.,
31 Jan., 11:59pm: Project Backtracking Search Deadline.
You will lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
·
Tue., 2 Feb.: Quiz #2.
·
Tue., 9 Feb.: Catch-up, Review for
Mid-term Exam.
·
Thu.,
11 Feb., Mid-term Exam.
·
REVISED: Sun., 21 Feb., 11:59pm: Project
Forward Checking & Bookkeeping Deadline. Extended deadline. Fix your
code, and resubmit clean working code. Your resubmitted clean assignment will
be regraded anew.
Sun., 14 Feb., 11:59pm: You will lose 10% of your Project grade
for every day it is late, pro-rated for fractional days and rounded up to the
nearest integer percentage point above.
·
REVISED: optional for extra credit under
“advanced techniques.” Sun., 21 Feb.,
11:59pm: Project Arc Consistency & Bookkeeping Deadline. You will
lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
·
Tue., 23 Feb.: Quiz #3.
·
REVISED:
Merged with the LCV deadline Sun, 6 Mar. Deadline Sun., 28 Feb., 11:59pm:
Project MRV & DH Heuristic Deadline. You will lose 10% of your Project
grade for every day it is late, pro-rated for fractional days and rounded up to
the nearest integer percentage point above.
·
REVISED:
Merged in MRV & DH.
Sun., 6 Mar.., 11:59pm: Project MRV, DH, & LCV Heuristic Deadline. You
will lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
·
Tue., 8 Mar.: Quiz #4.
·
Thu.,
10 Mar.: Catch-up, Review for Final Exam.
·
Wed.,
16 Mar, 11:59pm: Sun., 13 Mar., 11:59pm: Final
Project Deadline. You will lose 10% for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
·
Fri., 18 Mar., 10:30am-12:30pm: Final
Exam.
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.
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 always will 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
helpful student kindly contributed this link to a blog that offers a PDF of the
course textbook, for which I cannot vouch:
http://crazy-readers.blogspot.com/2013/08/artificial-intelligence-modern-approach.html
Another
helpful student kindly contributed this link, which also offers a PDF of the
course textbook, again for which I cannot vouch:
You
can also try to search the Internet for “artificial intelligence a modern
approach pdf 3rd edition”. Several more hits turned up the last time I
did so.
A
helpful student kindly contributed the following suggestion, for which I cannot
vouch:
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 often tweak or revise the lecture
slides prior to the lecture; please ensure that you have the current version.
Please read the assigned textbook reading and review the lecture notes in advance of each lecture, then again after each lecture.
Tue.,
5 Jan., Introduction, Agents.
Read
in Advance: Textbook Chapters 1-2.
Lecture
slides: Introduction, Agents [PDF; PPT].
Thu., 7 Jan., start Constraint Satisfaction.
Read in advance: Textbook
Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Satisfaction Problems [PDF;
PPT].
Fri., 8 Jan.,
Discussion Section.
Discussion Section slides [PDF].
Optional Reading:
John
McCarthy, “What
Is Artificial Intelligence?”
AAAI,
AI Overview.
Optional Cultural Interest:
IBM Watson: Final Jeopardy! and the Future of Watson
AI vs. AI.
Two chatbots talking to each other.
Silicon
Valley Kingpins Commit $1 Billion to Create Artificial Intelligence Without Profit Motive
Read
in advance: Textbook Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Propagation [PDF;
PPT].
Thu., 14 Jan., Uninformed
Search.
Read
in Advance: Textbook Chapter 3.1-3.4.
Lecture
slides (three parts):
(1)
Introduction to Search [PDF; PPT]; and
(2)
Uninformed Search [PDF; PPT].
Fri., 15 Jan.,
Discussion Section.
Discussion Section slides
[PPT].
Notify
us about your team status. Put your team name and
partner status in the EEE Dropbox named “Project Team Status.”
PLEASE DO NOT PUT SPACES IN YOUR TEAM NAME, as spaces may break our Unix scripts.
(1)
What is your team name? creativity is encouraged!
(2)
Who is your partner? or are you a solo team?
Filename:
“<your
last name>_< UCI numeric ID>_< team name>.txt”
File format:
NAME
= <your full name>
UCIID
= <your UCI numeric ID>
TEAMNAME
= <your team name with NO SPACES>
PARTNER
= {“solo” | your partner’s full name and UCI numeric ID}
There is an EEE CS-171 MessageBoard forum "Seeking CS-171 Coding Project
Partner" intended for use by students who seek a project partner.
Optional Reading:
Newell & Simon’s “Symbols and Search” Turing
Award Lecture (1976).
Herbert
Simon is the only computer scientist to be awarded a Nobel Prize (in economics,
1978).
“Flexible Muscle-Based Locomotion for Bipedal Creatures” --- paper.
Optional Cultural Interest:
“Flexible Muscle Based Locomotion for Bipedal
Creatures” --- video
Boston Dynamics Big Dog (new
video March 2008)
Cheetah Robot runs 28.3 mph;
a bit faster than Usain Bolt
Tue., 19 Jan., Quiz #1 (answer key here); Heuristic
Search.
Read
in advance: Textbook Chapter
3.5-3.7.
Lecture
slides: Heuristic Search [PDF; PPT].
Thu., 21 Jan., Local Search.
Read in advance: Textbook Chapter 4.1-4.2.
Lecture
slides (two parts):
(1)
Local Search [PDF;
PPT]; and
(2)
Representation [PDF;
PPT].
Fri., 22 Jan.,
Discussion Section.
Discussion
Section slides [PPT].
Optional Ungraded Homework:
Optional Reading:
Alan Turing’s classic paper on AI (1950).
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”
Minton,
et. al., 1990, AAAI "Classic
Paper" Award recipient in 2008.
How to solve the 1 Million Queens problem and schedule space
telescopes.
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/.
Interesting
search algorithm visualization web page.
A* Search in Interplanetary Trajectory Design, courtesy of Eric Trumbauer, former
CS-271 student.
Eric
comments, “One thing to possibly discuss with the last slide is that the
itinerary it settles on does stay at a higher energy for a little bit until it
passes closest to Europa, maximizing the velocity before the insertion sequence
to the lower energy. This is indeed
optimal behavior, as opposed to immediately reducing its energy as a Greedy
Best First algorithm using this heuristic would want to do.”
A*
Search in Protein Structure Prediction, Lathrop and Smith, J. Mol. Biol.
255(1996)641-665
“Hill
Climbing with Simulated Annealing”
The
program learns to build a car using a genetic algorithm.
If
you let this program run for a long time (>> 30 generations), you will
see that eventually it produces cars well suited to the terrain. This outcome
illustrates a general theme of genetic algorithms: very, very slow; but,
eventually, good performance. After all, it took ~3.6 billion years to evolve humans
from bacteria (http://en.wikipedia.org/wiki/Timeline_of_evolutionary_history_of_life).
Please note that this eventual good performance of genetic algorithms is conditional
upon a representation that allows good solutions to sub-problems to be combined
simply, by cross-over, into a globally good solution; if the vector position of
the features is completely randomized within the chromosome, any such good
performance is lost.
Tue. 26 Jan., start Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.1, 5.2, 5.4.
Lecture
slides: Games/Adversarial Search/MiniMax Search [PDF; PPT].
Thu., 28 Jan., finish
Games/Adversarial Search.
Special 2 minute Blood
Donor Center presentation.
Read in advance: Textbook
Chapter 5.3. (Optional: Chapter 5.5 and beyond.)
Lecture
slides: Games/Adversarial Search/Alpha-Beta Pruning [PDF; PPT].
Fri., 29 Jan., Discussion Section.
Discussion
Section slides [PPT].
Optional Ungraded Homework:
Optional Reading:
Campbell, et al., 2002, Artificial
Intelligence, “Deep Blue.” [PDF]
(URL
http://www.sciencedirect.com/science/article/pii/S0004370201001291)
Details about the AI system that beat the human chess champion.
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.
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).
Related URL: “Everything
Monte Carlo Tree Search” website.
Optional Cultural Interest:
RoboCup 2012 Standard Platform: USA / Germany (Final).
“Complete Map of Optimal Tic-Tac-Toe Moves.”
Tue., 2 Feb., HAPPY GROUNDHOG DAY!!
Quiz #2 (answer key here); start
Propositional Logic.
Read
in advance: Textbook Chapter 7.1-7.4.
Lecture
slides: Propositional Logic A [PDF; PPT].
Thu., 4 Feb., finish Propositional
Logic.
Read
in advance: Textbook Chapter 7.5 (optional: 7.6-7.8).
Lecture slides: Propositional Logic B [PDF; PPT].
Additional
Discussion lecture slides [PDF].
Fri., 5 Feb., Discussion Section.
Discussion
Section slides [PPT].
Optional Reading:
Autonomous car - Wikipedia,
the free encyclopedia
“Autonomous
Driving in Traffic: Boss and the Urban Challenge” (2009).
Optional Cultural Interest:
Audi
Piloted Parking (Audi's self-parking car)
Tesla Model S P85D AWD and
auto-pilot demo
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
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]
Tue., 9 Feb., 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].
Thu., 11 Feb., 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).
Fri., 12 Feb., Discussion Section.
Discussion
Section slides [PPT].
No homework --- study for the
Mid-term Exam.
Optional Cultural Interest:
“Quadrocopter
Pole Acrobatics”
“Nano
Quadcopter Robots swarm video” [need to fix link]
The
Stanford Autonomous Helicopter performing an aerobatic airshow under computer
control:
“Stanford Autonomous
Helicopter - Airshow #1”
“Stanford Autonomous
Helicopter - Airshow #2 Redux”
Tue., 16 Feb., Review
Mid-term Exam;
Thu., 18 Feb.,
Fri., 19 Feb., Discussion Section.
Discussion
Section slides [PPT].
Optional Ungraded Homework:
Tue., 23 Feb., Quiz #3 (answer
key here);
start First Order Logic
Read in advance: Textbook Chapter 8.1-8.2.
Lecture
slides: First Order Logic Syntax [PDF; PPT].
Thu., 25 Feb., 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 Lecture slides:
First Order Logic Inference [PDF; PPT].
Optional read in advance:
Textbook Chapter 9.1-9.2, 9.5.1-9.5.5.
Optional Reading:
Cyc is a large-scale knowledge-engineering project:
“CYC: A Large-Scale Investment in Knowledge Infrastructure,” Lenat, 1995
“Searching for Commonsense: Populating Cyc from the Web,” Matuszek et al, AAAI 2005
Cyc - Wikipedia, the free encyclopedia.
Optional Cultural
Interest:
Hitting the road: Hitchbot begins cross-Canada journey
“Canada's
hitchBOT travels 4,000 miles to test human-robot
bonds --- LA Times.”
HitchBOT, the hitchhiking robot, gets beheaded in
Philadelphia
Fri., 26 Feb., Discussion Section.
Discussion
Section slides [PPT].
Optional Ungraded Homework:
Optional Cultural Interest:
“Janken (rock-paper-scissors) Robot with 100% winning
rate”
(Snakes,
spiders, and a talking head!):
“Asterisk - Omni-directional
Insect Robot Picks Up Prey #DigInfo”
“Freaky AI robot, taken from Nova science now”
Tue, 1 Mar., Probability, Uncertainty, Graphical Models, Bayesian Networks.
Guest Lecture by Junkyu Lee
Read in advance: Textbook Chapters 13, 14.1-14.5.
Reasoning Under Uncertainty.
Bayesian Networks.
Optional Cultural Interest:
Video of Judea Pearl’s 2011 Turing Award lecture.
The Mechanization of Causal Inference: A “mini” Turing Test and Beyond.
“Peter Norvig 12. Tools of AI: from logic to probability.”
Thu., 3 Mar., start Learning
from Examples.
Read in advance: Textbook Chapter 18.1-18.4.
Lecture
slides: Intro to Machine Learning [PDF; PPT].
Fri., 4 Mar., Discussion Section.
Discussion
Section slides [PPT].
Optional Ungraded Homework:
Optional Reading:
“Machine learning”
- Wikipedia, the free encyclopedia
“Data mining” -
Wikipedia, the free encyclopedia
Ferrucci, et al., 2010, “Building
Watson: An Overview of the DeepQA Project”
Proof that Decision Tree information gain is always non-negative (problem 3, pp. 4-5).
“Google
reveals it is developing a computer so smart it can program ITSELF.”
Danziger, et al., 2009, “Predicting Positive p53 Cancer Rescue Regions Using Most Informative Positive (MIP) Active Learning”
Kim
& Xie, 2014, “Handwritten
Hangul recognition using deep convolutional neural networks”
Baldi, Sadowski, & Whiteson, 2014, “Searching
for Exotic Particles in High-Energy Physics with Deep Learning”
Tue., 8 Mar., Quiz #4 (answer key here);
finish Learning from Examples.
Happy International Woman’s Day!
Read in advance: Textbook Chapter 18.5-18.12, 20.1-20.2.
Lecture slides:
Learning Classifiers [PDF; PPT].
Thu., 10 Mar., Catch-up, Review for Final Exam.
Read in advance: Textbook, review all assigned reading.
Lecture
slides: Review, Catch-up, Question&Answer [PDF; PPT].
Fri., 11 Mar., Discussion Section.
Discussion
Section slides [PPT].
Sun.,
13 Mar., 11:59pm, Project Final Report Deadline:
Deadline to deposit your project Final Report in
EEE Dropbox.
You
will lose 10% of your Project grade for every day it is late, pro-rated for
fractional days and rounded up to the nearest integer percentage point above.
Wed., 16 Mar., 11:59pm:
No Project Final Reports
accepted hereafter.
Optional Ungraded Homework:
Optional Reading:
Gaffney,
et al., 2007, “Probabilistic
clustering of extratropical cyclones using regression mixture models”
Optional Cultural Interest:
“IBM
simulates 530 billon neurons, 100 trillion synapses on supercomputer”
“Speech Recognition
Breakthrough for the Spoken, Translated Word”
Optional Lecture slides: Clustering (unsupervised learning) and Regression (statistical numeric learning).
Clustering (Unsupervised Learning) [PDF; PPT].
Optional Associated Reading: Textbook Chapter 18.6.1-2, 20.3.1.
Optional Lecture slides:
Viola & Jones, Learning, Boosting, Vision [PDF; PPT] (read the two papers
immediately below)
Optional Associated Reading:
Viola & Jones, 2004, “Robust Real-Time
Face Detection”
Optional Associated Reading: Freund & Schapire, 1999, “A Short Introduction to Boosting”
Fri., 18 Mar., 10:30am-12:30pm.
(answer key here)
11 Mar 2016: The Monster
Sudoku Final Report Template has been revised to clarify the distinction
between completable and solvable,
and the new version is available here.
3 Mar 2016: The Monster
Sudoku Final Report Template is available here.
(1) A Java coding shell for Sudoku is available in case it may be helpful
to you as an example (shell is here).
I do not yet have C++ or Python shells (they will be written this quarter), and
it has never been tested by “live” use in a CS-171 class. In spite
of these limitations, we thought it might be helpful to you as an example.
(2) (revised 1 Mar 2016) The tester program has been removed
because it has been replaced by the grader program. Teams that deposit their
code in EEE DropBox by midnight, Friday, 4 March,
will have their code run through the grader program and be notified of any
errors by Saturday morning. (revised 3 Feb
2016) Thanks to the good efforts of Minhaeng Lee, the
Reader, a test shell to validate your programs on openlab.ics.uci.edu is
available here.
This shell is only for testing whether student's program is runnable on the openlab environment. Please note that, currently, the
testing shell doesn't contain tests for whether or not the output is correct. We
will update it later.
(3) Thanks to the good efforts of Junkyu Lee,
the TA, a detailed description of exactly what to turn in for your Sudoku
Project Assignments is available here. It will be updated as we go along. Please
note that we are still discussing what to do about the Generator portion of the
project, which was canceled because the provided Java shell included a
generator. However, apparently some students have written their own generator
anyway. Most likely we will give extra credit for extra work; but the matter is
still under discussion. In the meantime, it is OK if your program accepts the
GEN and BT option tokens. If you wrote your own generator then exactly one
of the GEN and BT tokens must be present (one is required but they are mutually
exclusive), and they govern whether your program is being run in generate (GEN)
or solver (BT) mode. If you did not write your own generator then you may
ignore, but must tolerate, both the GEN and BT tokens. Please see the Sudoku
Project Assignments document described in this paragraph for more details.
(4) A slideshow
about the Monster Sudoku coding project is available here.
(5) Merged with Sudoku Project Assignments (above). A Specification for your Monster
Sudoku problem Reader and Generator is available here. It is largely superseded
because the provided Java shell already contains a Generator.
(6) Just for fun, once upon a time I wrote LISP code (available here) that
computes the "odometer" style tokens up to any arbitrarily large N
(example of the resulting tokens available here). Please note that this
"odometer" material is purely for cultural interest, i.e., you will
never be responsible for "odometer" style tokens above 35 on quizzes,
exams, or the project.
Nevertheless, it is a curious wrinkle that is interesting to see,
especially if you are interested in bigger and better.
Please note:
The C++ target platform should be x86. You should write your code to run on any
x86 machine. The OS is CentOS 6. We most likely will
need to compile your code with CentOS 6 (RHEL 6) x86_64. Machines in the
openlab.ics.uci.edu (family-guy.ics.uci.edu) are CentOS 6. Your code should run
on openlab.ics.uci.edu.
Project Deadlines:
·
Project
deadlines are given above in the Important Dates
section.
·
Your EEE DropBox submission must be a single “zipped”
file named “yourLastName_yourUCINumericID_yourTeamName.” NO SPACES in yourTeamName.
·
It should have three
subdirectories: src, bin, & doc; for source,
executable, and documents (‘doc’
must contain your Project Report).
·
Please deposit only one
submission per team.
·
If your partner has
deposited your submission, please deposit a text file stating your name/ID,
your partner’s name/ID, and your team name. Please use the same filename
format given above.
·
You
will lose 10% of your project score for each day (or part thereof) that your
project is late for any deadline. Please submit your project early, well ahead
of the deadline, and avoid the last-minute rush. If system problems, web
congestion, or other unavoidable Internet delays make your project late, it is
still late and will be penalized.
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.
Please note
that some of the very old tests below reflect different textbooks that may
define some things differently than does your current textbook. In case of
conflict, your current textbook is deemed correct and will prevail. Some of
your visualization systems may not display the red PDF overlays used to correct
errors in very old tests. For example, in problems #2a, #2c, #3a, and #3b on
Quiz #2 from SQ’2004, the PDF overlay is invisible on a Mac (iPad), and
possibly on some other systems or printers. The PDF overlays just do not seem to
work as advertised (sorry!!), but this problem seems only to afflict very old
tests (i.e., from over a decade ago). If you are confused by any of the answers
below, please bring your questions to the TA in Discussion Section. If you find a genuine error anywhere,
please send me email and you will receive a Bonus Point if correct.
Also, a
student has recommended ‘quizlet.com’ as a good online study
resource. While I cannot vouch for it, apparently it contains several good
study aids for your textbook.
Winter Quarter 2016:
Mid-term Exam and key.
Final Exam and key.
Fall Quarter 2015:
Mid-term Exam and key.
Final Exam and key.
Winter Quarter 2015:
Mid-term Exam and key.
Final Exam and key.
Fall Quarter 2014:
Mid-term Exam and key.
Final Exam and key.
Winter Quarter 2014:
Mid-term
Exam and key
Final
Exam and key
Fall Quarter 2013:
Mid-term
Exam and key
Final Exam and key
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:
The correct
answer to Quiz #2 (2a) is A B D E C G.
The correct
answer to Quiz #2 (2c) is A; A B C G.
The correct
answer to Quiz #2 (3a) is N.
The correct
answer to Quiz #2 (3b) is N.
These emendations to Quiz #2 have been corrected by overlays to the old PDF files, but apparently those corrections may not be not visible on some systems (MAC/iPAD?) or when printed on some printers (?). Please be warned.
Spring Quarter 2000:
Additional Online Resources may be posted as the class progresses.
Textbook website for Artificial Intelligence: A Modern Approach (AIMA).
AAAI
Digital Library of more
than 10,000 AI technical papers.
AAAI AI Magazine.
AAAI Author Kit.
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 Academic Senate Policy On Academic Integrity and the ICS School Policy on Academic Honesty.
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.