v
16Dec2015:
All student scores have been posted and distributed to EEE GradeBook
except “ConnectK Project” upon which we are
still working. PLEASE go to EEE immediately, verify that all of your grades are
correct, and notify all of us immediately if you detect any error.
In
particular, please check your ConnectK Final Tournament
results. Student overcrowding has made this class tournament extremely
difficult. This is the largest CS-171 class that I have ever taught in my
>20 years with UC. The last time
I ran this tournament, there were only 50 teams. Now there are 133. Consequently, many
tournament tasks that were tedious but feasible to do manually before, are
completely infeasible to do manually now due to the greatly increased student
volume.
The
difficulty you are seeing is due to UC overcrowding as a result of California
state underfunding. There is an
agreed funding formula, but the state of California has been falling further
and further behind in its agreed funding of UC ever since I have been at UCI. The state of California insists that UC
accept more students, but does not provide funding for more faculty members. The result is UC student overcrowding
and increases in the UC tuition you must pay. If you care, please express your
opinion as a citizen and a voter to your California state legislator.
v
16Dec2015:
Thanks to the good efforts of the Tournament Staff (Reza Asadi,
Ahmad Majomard, and Minhaeng
Lee), the Final AI Tournament Rankings have been posted below in the Project section and are available here.
In
the end, the full round-robin tournament for which we hoped proved to be
infeasible due to its O(n^2) scaling in the face of student over-crowding.
Instead, we played each of your AIs against 10 other randomly chosen AIs, 6
games each (i.e., for each, 3 conditions X starting first and second). Each of
your resulting 60 games were scored as +1 for a win, ½
for a tie, and 0 for a loss. Your resulting score across your 60 games
determined your decile ranking, which has been posted to EEE.
v
8Dec2015:
The Final Exam answer key has been posted below and is available here.
v
1Dec2015:
The Quiz #4 answer key has been posted below and is available here.
v
24Nov2015:
The Connect-K Final Report template has been posted below in the Project section and is available here [PDF; Word].
v
24Nov2015:
Thanks to the good efforts of the Tournament Staff (Reza Asadi,
Ahmad Majomard, and Minhaeng
Lee), the Wumpus World Draft Tournament results have
been posted below in the Project section and are
available here. The file
gives detailed results for 50 caves and aggregate results at the bottom. The
ranking was: 1. Irrational Agent ~ -17524; 2. NoTeam
~ -39248; 3. Yurop ~ -44217; 4. Dummy Agent ~ -46018;
5. NewBee ~ -50000. However, some of the results seem perplexing and we are
looking into the matter further.
v
23Nov2015:
*PLEASE* do complete your student teaching evaluations for CS-171, Intro to AI.
Every student who fills out a course
evaluation for CS-171 will receive a bonus of 1% added to their final grade,
free and clear, off the curve, simply a bonus. EEE will return to me the names of students who fill out
evaluations (but not the content, which remains anonymous), provided that
enough students fill out evaluations so that anonymity is not compromised. I will add 1% free bonus to the final
grade of each such named student.
Student
course evaluations are very important to me for monitoring and improving the
course content, and very important to UCI for evaluating our success at our
educational mission. Many of the good features of CS-171 that you now enjoy
originally were suggested by previous CS-171 students on their student teaching
evaluations.
I
do listen and respond to what you say.
v
22Nov2015:
Thanks to the good efforts of the Tournament Staff (Reza Asadi,
Ahmad Majomard, and Minhaeng
Lee), detailed instructions for your Game AI submissions have been posted below
in the Project section and are available here. PLEASE,
follow these instructions *scrupulously*.
You may lose points if your failure to follow these instructions breaks our
scripts and so your Game AI cannot be run.
v
20Nov2015:
The ConnectK Draft AI Results against AI_Poor, AI_Average, and AI_Good, plus the error log, have been posted below in the Project section and are available here.
v
19Nov2015:
The Quiz #3 answer key has been posted below and is available here.
v
16Nov2015:
In response to a suggestion from a student, I have revised the pseudocode for
alpha-beta pruning to be clearer and more detailed. The revised pseudocode
appears as slides 18 & 19 in the lecture notes for Tue., 13 Oct., finish
Games/Adversarial Search, Games/Adversarial Search/Alpha-Beta Pruning. The
original pseudocode was taken from your textbook, Fig. 5.7, p. 170. While it is correct, I agree with the
student that it is so compressed that it is difficult to see the details.
v
12Nov2015:
Due to technical difficulties with the very large number of teams, we have not
yet been able to get the Java error log (i.e., corresponding to the C++ error
log sent out earlier). Since it would be unfair to the Java teams to have less
time to fix their errors than the C++ teams, we are going to tweak the deadline
extension conditions (below) to be somewhat more favorable to you. All the
deadlines and conditions hold below *except* “a working draft AI”
is replaced by “a draft AI that you make work after the Tournament Staff
provides you with error feedback.”
v
12Nov2015:
A student pointed out that a blanket deadline extension was unfair to the
diligent hard-working teams who got their draft AI in by the original deadline.
Consequently, to reward diligent hard-working students, any team who got their
draft AI in by the original deadline will receive an extra-credit bonus of 5%
of your project points.
v
10Nov2015:
As posted to the class mailing list, The
CS-171 Tournament Staff has decided to give you a draft AI code-fixing deadline
extension with no grade penalty. The extended deadline with no grade penalty
for you to fix your code and submit a *working* draft AI is Fri., 13
Nov., 11:59pm. You will lose 10% of your project grade if your draft AI
submission misses that extended deadline. The *absolute* deadline beyond
which no draft AIs will be accepted is Sat., 14 Nov., 11:59pm. Just to be
clear:
(1)
If you submit a *working* draft AI by Fri., 13 Nov., 11:59pm, there is
no grade penalty.
(2)
If not, but you do submit a *working* draft AI by Sat., 14 Nov.,
11:59pm, you lose 10% of your project grade.
(3)
If your *working* draft AI does not beat or tie AI_poor
in at least one of its six games, you lose 10% of your project grade.
(4)
If you do *not* submit a working draft AI by Sat., 14 Nov., 11:59pm, you
lose 20% of your project grade (10% for being late plus 10% for failing to beat
or tie AI_poor).
v
5Nov2015:
As posted to the class mailing list, TA and Tournament Director Reza Asadi has clarified that below “run on the ICS lab
machines” means run on openlab.ics.uci.edu.
v
5Nov2015:
EEE DropBoxes have been created for your Draft AIs.
Use “ConnectK_Draft_AI” for ConnectK and “Wumpus_Draft_AI”
for Wumpus World. As stated below:
1.
Your
EEE DropBox submission must be a single
“zipped” file named “yourLastName_yourUCINetID_yourTeamName.”
2.
It
should have three subdirectories: src, bin, &
doc; for source, executable, and documents (‘doc’ not required
now).
3.
Please
deposit only one submission per team.
4.
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.
v
5Nov2015:
Benchmark details for the ConnectK Project AI have
been posted to the Grading section below. Specifically:
*
You will lose 10% of your Project points if your AI does not beat or tie AI_Poor in the Draft Tournament. It is sufficient to beat
or tie it in any one of your games.
*
You will lose 20% of your Project points if your AI does not beat or tie AI_Poor in the Final Tournament. It is sufficient to beat
or tie it in any one of your games.
*
You will lose 10% of your Project points if your AI does not beat or tie AI_Average in the Final Tournament (total loss of 30% if
your AI always loses to both AI_Poor and AI_Average). It is sufficient to beat or tie it in any one
of your games.
*
You will GAIN 10% BONUS of your Project points if your AI beats or ties AI_Good in the Final Tournament. It is sufficient to beat
or tie it in any one of your games.
*
The top 10% in the Final Tournament will receive 10% BONUS of your Project
points, the second 10% will receive 9% BONUS, the
third 10% will receive 8% BONUS, and so on. So, if you are clever and your AI is smart, you can
receive up to a total of 20% BONUS of your Project points.
v
3Nov2015:
The Mid-term Exam answer key has been posted below and is available here.
v
29Oct2015:
Thanks to the good efforts of Reza Asadi, CS-171 TA
and Tournament Director, there is a new Forum on our EEE MessageBoard:
“CS-171 Coding Projects Discussion.” This Forum is available for
CS-171 students to discuss various aspects of the coding projects as they go
along and reflect upon how, actually, to do it.
v
27Oct2015:
Several students have asked how they can be sure that their AI will run on my cluster in the tournament.
The answer is that if it runs on the ICS lab machines (specifically, openlab.ics.uci.edu) then it will run in the tournament.
Please be sure that your AI
runs successfully on the ICS lab machines (openlab.ics.uci.edu).
v
27Oct2015:
As announced today in lecture and posted to the class email list, Minhaeng Lee, CS-171 Reader, has concluded that the
included exe file depends on environment, so it may not be portable. His
suggestion, which we will adopt, is to drop exe files included in the fixed
code file and ask you to build your own exe files. The new version, without the
exe files, is available in the Project section below
and also here
(please reload your browser page before accessing the new version). Please
build your own exe files.
v
26Oct2015:
Several students have alerted me to further problems with the Connect-K
shell. Thanks to Minhaeng Lee, CS-171 Reader, these problems have been
fixed. The new version is available
in the Project section below and also here
(please reload your browser page before accessing the new version).
v
22Oct2015:
The Quiz #2 answer key has been posted below and is available here.
v
20Oct2015:
For those of you unable to attend the ICS FACULTY PANEL ON IMPROVING YOUR GRAD
SCHOOL APPLICATION, the link to the video is here.
v
20Oct2015:
With gravity *on* the tournament game boards will be no larger than 10x10. With
gravity *off* the tournament game boards will be no larger than 7x7. In all
cases your AI will have five seconds to make its next move.
v
16Oct2015:
Thanks to a kind and helpful student, plus the diligent efforts of the CS-171
Teaching Staff, the Java/C++ shell problem has been fixed. The fixed code is
available in the Project section below and also here. There still
appears to be a problem with the tournament Java/C++ shell and we hope to fix
that problem shortly.
v
15Oct2015:
The Wumpus World shell has been released and is
available below in the Project section or here. See the Project section for details.
v
15Oct2015:
In introducing heuristics I told an amusing story about Aristotle jumping out
of the public bath and running down the street shouting,
“Eureka!” But, it turns
out that it actually was Archimedes, another famous ancient Greek.
v
14Oct2015:
To clarify the interaction between IDS node reordering and value propagation in
MiniMax and Alpha-Beta Pruning, I have revised slides
36-43 of the lecture notes for Games/Adversarial Search/Alpha-Beta Pruning,
Tue., 13 Oct. The basic ideas and
intuitions remain the same.
However, I have made explicit the return value backpropagation so that
it is clearer why and where pruning is done.
v
8Oct2015:
Please be sure to attend the Friday Discussion Section tomorrow, 9Oct2015. The
TA will discuss Game/Adversarial Search generally, and especially will lead a
discussion and answer questions on heuristic evaluation functions. The goal is
to help move you forward in your coding project.
v
8Oct2015:
The Quiz #1 answer key has been posted below and is available here.
v
6Oct2015:
The Connect-K coding shells and a collection of student coding resources is now available in the Project
section below.
v
6Oct2015:
The Discussion Section lecture slides for Fri., 3 Oct., have been posted below
and also are available here [PDF; PPT]. The
Discussion Section lecture slides for Fri., 25 Sep., are the same as the
Lecture Slides of Thu., 24 Sep., and also are available here [PDF; PPT].
v
6Oct2015:
The lecture of Tue., 1 Dec., will be a guest lecture by Reza Asadi.
v
6Oct2015:
Quizzes and Exams will be available for pick-up in Discussion Section.
v
3Oct2015:
Office hours for the CS-171 Teaching Staff have been posted to the class
website(see Place, Time, Instructors):
o
Minhaeng
Lee: Monday, 2:00-3:00pm, or anytime by appointment, in DBH-4219.
o
Reza
Asadi: Tuesday, 2:00-3:00pm, or anytime by
appointment, in DBH-4013.
o
Richard
Lathrop: Wednesday 2:00-3:00pm, or anytime by appointment, in DBH-4224.
o
Ahmad
Majomard: Friday, 10:00-11:00am, or anytime by
appointment, in DBH-3081.
v
24Sep2015:
There is an EEE CS-171 MessageBoard forum
"Seeking CS-171 Coding Project Partner" intended for use by students
seeking a project partner.
v
24Sep2015:
If for any reason you are enrolled but not on the EEE class mailing list
(Exchange student?), please let me know so that I can make other arrangements
for you to get class email.
v
24Sep2015:
Please plan to attend the ICS Faculty Panel
on Improving Your Grad School Application, Thursday, 15 October,
noon-1:50pm, in DBH-6011. Pizza and
light refreshments will be served.
(If you have a time conflict, note that a video of the event will be posted
on the ICS SAO website.) Please
review this US Bureau of Labor Statistics chart on “Earnings and
unemployment rates by educational attainment.”
Moral: The more you learn, the more you
earn.
v Current
announcements will appear here, at top-level, for quick and easy inspection.
·
Thu.,
8 Oct.: Quiz #1.
·
Fri.,
9 Oct., 11:59pm: Project Team Formation Deadline.
You will lose 10% of your Project grade for every day or fraction thereof it is
late.
·
Thu.,
22 Oct.: Quiz #2.
·
Thu.,
29 Oct.: Catch-up, Review for Mid-term Exam.
·
Tue., 3 Nov., Mid-term Exam.
·
Sun., 8 Nov., 11:59pm: Draft Project
Deadline. You will lose 10% of your Project grade (or extra-credit Bonus) for
every day or fraction thereof it is late.
·
Tue., 17 Nov.: Quiz #3.
·
Tue., 1 Dec.: Quiz #4.
·
Thu.,
3 Dec.: Catch-up, Review for Final Exam.
·
Fri., 4 Dec., 11:59pm: Final Project
Deadline. You will lose 10% for every day or fraction thereof it is late.
·
Sun,
6 Dec., 11:59pm: No Project AIs accepted hereafter.
We need time to run the tournament.
·
Tue., 8 Dec., 4:00-6:00pm: 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 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 and review the lecture notes in advance of each lecture, then again after each lecture.
Thu., 24 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 Cultural Interest:
Silicon
Valley Kingpins Commit $1 Billion to Create Artificial Intelligence Without Profit Motive
Optional
Reading:
John
McCarthy, “What
Is Artificial Intelligence?”
AAAI,
AI Overview.
Fri., 24 Sep., Discussion
slides are the same as the Lecture Slides of Thu., 24 Sep., and also are
available here [PDF;
PPT].
Tue., 29 Sep.,
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].
Optional Cultural Interest:
Boston Dynamics Big Dog (new
video March 2008)
Cheetah Robot runs 28.3 mph;
a bit faster than Usain Bolt
Optional Reading:
Newell
& Simon’s “Symbols and Search” Turing Award Lecture
(1976).
Herbert
Simon was awarded a Nobel Prize (in economics, 1978).
Thu., 1 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/.
Optional
Cultural Interest:
Interesting
search algorithm visualization web page.
Optional Cultural Interest:
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.”
Optional
Cultural Interest:
A*
Search in Protein Structure Prediction, Lathrop and Smith, J. Mol. Biol.
255(1996)641-665
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”
Fri., 2 Oct., Discussion slides, Search [PDF; PPT].
Tue., 6 Oct.,
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].
Optional URLs:
“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.
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:
Thu., 8 Oct., Quiz #1 (answer key here);
start Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.1, 5.2, 5.4.
Lecture
slides: Games/Adversarial Search/MiniMax Search [PDF; PPT].
Optional
Cultural Interest:
RoboCup 2012 Standard Platform: USA / Germany (Final).
Optional URL: “Complete Map of Optimal Tic-Tac-Toe Moves.”
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.
Fri.,
9 Oct., 11:59pm:
Deadline to notify the Readers (Minhaeng
Lee, minhaenl@uci.edu; Ahmad Majomard,
srazavim@uci.edu) about your team status.
(1)
What is your team name --- creativity is encouraged!
(2)
Who is your partner? or are you a solo team?
There
is an EEE CS-171 MessageBoard forum "Seeking
CS-171 Coding Project Partner" intended for use by students seeking a
project partner.
You
will lose 10% of your Project grade for every day or fraction thereof it is
late.
Tue., 13 Oct., finish
Games/Adversarial Search.
Read in advance: Textbook
Chapter 5.3. (Optional: Chapter 5.5 and beyond.)
Lecture
slides: Games/Adversarial Search/Alpha-Beta Pruning [PDF; PPT].
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:
Thu., 15 Oct.,
start Propositional Logic.
Read
in advance: Textbook Chapter 7.1-7.4.
Lecture
slides: Propositional Logic A [PDF; PPT].
Optional Cultural Interest:
Tue., 20 Oct.,
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].
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]
Optional
Reading:
Autonomous car - Wikipedia,
the free encyclopedia
“Autonomous
Driving in Traffic: Boss and the Urban Challenge” (2009).
Thu., 22 Oct., Quiz #2 (answer key here); Probability, Uncertainty
Read in advance: Textbook Chapter 13.
Lecture
slides:
Reasoning Under Uncertainty [PDF; PPT].
Optional
Cultural Interest:
Video
of Judea Pearl’s 2011 Turing Award lecture.
The Mechanization of Causal Inference: A “mini” Turing Test and Beyond.
Optional URL: “Peter Norvig 12. Tools of AI: from logic to probability.”
Optional
Cultural Interest:
“Janken (rock-paper-scissors) Robot with 100% winning
rate”
Optional
Ungraded Homework:
Tue., 27 Oct., Graphical Models, Bayesian Networks.
Read in advance: Textbook Chapters 14.1-14.5.
Lecture
slides:
Optional
Cultural Interest (Happy Halloween!
Snakes, spiders, and a talking head!):
“Asterisk - Omni-directional
Insect Robot Picks Up Prey #DigInfo”
“Freaky AI robot, taken from Nova science now”
Thu., 29 Oct., Catch-up, Review for Mid-term Exam.
Read in advance: Textbook Chapters 2-5, 7, 13, 14 (only sections assigned above).
Lecture
slides: Catch-up, Review, Question&Answer [PDF; PPT].
Optional
Cultural Interest:
“Quadrocopter Pole Acrobatics”
“Nano
Quadcopter Robots swarm video”
The
Stanford Autonomous Helicopter performing an aerobatic airshow under computer
control:
“Stanford Autonomous
Helicopter - Airshow #1”
“Stanford Autonomous
Helicopter - Airshow #2 Redux”
No
homework --- study for the Mid-term Exam.
Tue., 3 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).
Thu., 5 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:
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
Sun.,
8 Nov., 11:59pm.
Deadline to deposit your Draft project AI(s) in
EEE Dropbox.
1. Your EEE DropBox submission must be a
single “zipped” file named “yourLastName_yourUCINetID_yourTeamName.”
2. It should have three subdirectories: src,
bin, & doc; for source, executable, and documents (‘doc’ not
required now).
3. Please deposit only one submission per team.
4. 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.
5. Use “ConnectK_Draft_AI” for ConnectK and “Wumpus_Draft_AI”
for Wumpus World.
You
will lose 10% of your Project grade for every day or fraction thereof it is
late.
Tue., 10 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
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
Ungraded Homework:
Thu., 12 Nov., start Constraint Satisfaction.
Read in advance: Textbook
Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Satisfaction Problems [PDF;
PPT].
Read
in advance: Textbook Chapter 6.1-6.4, except 6.3.3.
Lecture
slides: Constraint Propagation [PDF;
PPT].
Optional
Cultural Interest:
“Flexible Muscle Based Locomotion for Bipedal
Creatures” --- video
“Flexible Muscle-Based Locomotion for Bipedal Creatures” --- paper.
Thu, 19 Nov., start Learning from
Examples.
Read in advance: Textbook Chapter 18.1-18.4.
Lecture
slides: Intro to Machine Learning [PDF; PPT].
Optional
Reading:
Ferrucci, et al., 2010, “Building
Watson: An Overview of the DeepQA Project”
“Machine learning”
- Wikipedia, the free encyclopedia
“Data mining” -
Wikipedia, the free encyclopedia
Optional
URL: “Google
reveals it is developing a computer so smart it can program ITSELF.”
Optional URL: Proof that Decision Tree information gain is always non-negative (problem 3, pp. 4-5).
Optional
Ungraded Homework:
Tue., 24 Nov., finish
Learning from Examples.
Read in advance: Textbook Chapter 18.5-18.12, 20.1-20.3.2.
Lecture slides:
Learning Classifiers [PDF; PPT].
Optional
Lecture slides: Viola & Jones, Learning, Boosting, Vision [PDF; PPT] (read
the two papers 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”
Optional
Reading: Kim & Xie, 2014, “Handwritten
Hangul recognition using deep convolutional neural networks”
Optional
Reading: Baldi, Sadowski,
& Whiteson, 2014, “Searching
for Exotic Particles in High-Energy Physics with Deep Learning”
Thu., 26 Nov., Thanksgiving
Holiday. Give thanks!
Tue., 1 Dec., Quiz #4 (answer key here);
Clustering (unsupervised learning) and Regression (statistical
numeric learning).
Guest lecture
by Reza Asadi.
Read in advance: Textbook Chapter 18.6.1-2, 20.3.1.
Lecture slides:
Clustering (Unsupervised Learning) [PDF; PPT].
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 Ungraded Homework:
Thu., 3 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.,
4 Dec., 11:59pm:
Deadline to deposit your Draft project AI(s) in
EEE Dropbox.
1. Your EEE DropBox submission must be a
single “zipped” file named “yourLastName_yourUCINetID_yourTeamName.”
2. It should have three subdirectories: src,
bin, & doc; for source, executable, and documents (‘doc’ must contain your Project Report).
3. Please deposit only one submission per team.
4. 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.
You
will lose 10% of your Project grade for every day or fraction thereof it is
late.
Sun, 6 Dec., 11:59pm:
No Project AIs accepted
hereafter.
Tue., 8 Dec., 4:00-6:00pm.
(answer key here)
Connect-K Game AI.
(REQUIRED)
22Nov2015: Thanks to
the good efforts of the Tournament Staff (Reza Asadi,
Ahmad Majomard, and Minhaeng
Lee), detailed instructions for your Game AI
submissions are available here. PLEASE, follow these instructions
*scrupulously*. You may lose points if your failure to follow these
instructions breaks our scripts and so your Game AI cannot be run.
20Nov2015: The ConnectK Draft AI Results against A_Poor,
AI_Average, and AI_Good,
plus the error log, are available here.
16Oct2015: Thanks to a
kind and helpful student, plus the diligent efforts of the CS-171 Teaching
Staff, the Java/C++ shell problem has been fixed. The fixed code is available here.
There still appears to be a problem with the tournament Java/C++ shell and we
hope to fix that problem shortly.
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. Shells will be available in
C++ and Java.
We will run a
tournament within which your AI controllers will compete against each other for
Bonus Points. Everyone’s AI will be entered in the tournament
automatically; the bonus points are simply free, based on how many games your
AI wins against other AIs. The top 10% winners will get 10% added to their
project grade as a bonus; the second 10% will get 9%; the third 10% will get
8%; and so on.
With gravity *on* the
tournament game boards will be no larger than 10x10. With gravity *off* the
tournament game boards will be no larger than 7x7. In all cases your AI will
have five seconds to make its next move.
An example
dumb game is available; an example
smart game is available; a collection of student coding
resources is available.
The coding resources
include:
(1) A Java shell.
(2) A C++ shell.
(3) A tournament shell,
which will let you play different versions of your AI against themselves to
refine your evaluation function.
(4) Three example AIs,
which you or your AI can play against: a good AI, an average AI, and a poor AI.
(5) The “DummyAI” source code, which your cleverness and
ingenuity will make smart.
(6) Several readme*.txt
files: readme.txt, readme-cPlusPlus.txt, readme-tournament.txt.
(7) ConnectK
hints, caveats, and heuristics.
(8) A changelog.txt.
Please note:
We'll run the tournament on SGE or a lab machine. 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.
Please note:
Connect-K, like most board games of its type, has a built-in advantage to the
first player (e.g., chess grandmasters try to win if they are white and play
first; they try to draw if they are black and play second). A
“fairer” game would have the first player make one move; then the
second player make two moves; then the first player make two moves; and so on,
alternately making two moves each, to neutralize the first-move advantage. The
point of this exercise is for you to write a “smart” AI, not to win
board games; nevertheless, be sure to run your AI both as first and second
player, then average the results.
Please note:
The shells may change as the quarter progresses. If so, we will try to keep the interface
the same, so that all you need do is change the surrounding shell.
The Project Specification and Project Report template
will be posted shortly.
Wumpus World Agent AI.
(OPTIONAL, extra-credit bonus)
This project
corresponds to Propositional Logic (Chapter 7 in your book) and Quantifying
Uncertainty (Chapter 13 in your book). Your job is to write logic-based and
probability-based agents for the Wumpus World (Chapter
7.2 in your book). This is a new project, and only a Java shell is available.
You will receive an extra-credit bonus for doing this project. Additionally, we
will run a Wumpus World project similar to the
Connect-K tournament above, within which your AI controllers will compete
against each other for Bonus Points.
The Wumpus
World project shell has been released and is available here. It contains
“dummy” and “irrational” agent shells that you will
make smarter, a Wumpus World GUI that enforces the
“laws of physics,” and a knowledge base agent that supports
“tell” and “ask” for propositional logic (note: prefix
form input). You can run your agent against given/random caves and watch it explore,
or in tournament mode to play against your other candidate agents or your
friends’ agents.
You may submit both a PropLogic agent and a Probability agent to the Wumpus World tournament. You will win Bonus Points in the
tournament as above. Rankings will be established by running every agent
against the same thousand caves and averaging its scores. The agent performance
measure is the score system given in your textbook. We might run the PropLogic agents and the Probability agents separately
because the Probability agents are expected to be strictly more powerful.
Project Deadlines:
·
Fri.,
9 Oct., 11:59pm: Deadline to notify the Readers (Minhaeng
Lee, minhaenl@uci.edu; Ahmad Majomard,
srazavim@uci.edu) about your team status (details here).
·
Sun.,
8 Nov., 11:59pm: Deadline to deposit a working "draft" version of
your AI(s) in the EEE DropBox (details here) for the
Draft Tournament.
·
Fri.,
4 Dec., 11:59pm: Deadline to deposit the final version of your AI(s) in the EEE
DropBox (details here) for the Final Tournament.
·
Sun, 6 Dec., 11:59pm: No Project AIs
accepted hereafter.
·
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.
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.
