Introduction To Artificial Intelligence: COS302 Michael L. Littman Fall 2001 MW 3-4:20 104
Introduction To Artificial Intelligence: COS302 Michael L. Littman Fall 2001 MW 3-4:20 104
Contact Information
Michael L. Littman [email protected] (Not to be confused with Michael G. Littman [email protected]) Course web page: http://www.cs.princeton.edu/courses/ archive/fall01/cs302/ real soon now
Administration
AI: A Modern Approach, Russell &
Norvig, 1994.
Teaching Assistants Gang Tan (gtan@cs) 215 Kedar Swadi (kswadi@cs) 416
Grading
Homework Programming Midterm Final Project Final Exam 20% 20% 20% 20% 20%
Programming primarily in C.
About You
Sophomores: Juniors: Seniors: Total: 5 25 29 59
About Me
Where was I? Research: Bellcore 88-92 PhD: (CMU) Brown Univ. 92-96 Prof.: Duke University 96-99 Research: AT&T Labs 00What do I do (in AI)? Planning under uncertainty Algorithm design Statistical natural lang. processing
What is AI?
Princeton student connections Minksy, Edmonds: neural computer 1951 McCarthy helped create the Dartmouth workshop in 1956 that defined the field. What is it now?
Family Feud
It's time for AI Family Feud! Let's meet the A-L family! - Ready for action!.... And the K-Z family! - On your marks!..Let's start AI FAMILY FEUD!
Round 1
Name a reason that humankind studies AI. Survey says!
X X X
next
Round 2
Name something that defines AI as distinct from other fields. Survey says!
X X X
next
Round 3
To the nearest 5 years, how long will it take humankind to create human-level AI?
Survey says!
next
X X X
Round 4
Name something that an AI system will do that will signal the arrival of human-level AI.
Survey says!
next
X X X
Round 5
Name the smartest AI from science fiction. Survey says!
X X X
next
Round 6
Name the most impressive accomplishment in AI in the last ten years.
Survey says!
next
X X X
Syllabus Sketch
I. Search
Example: Rush Hour Puzzle
http://kgs.kiseido.com/~wms/rushHour/
I. Search
9/17 9/19 9/24 9/26 10/ 1 10/ 3 10/ 8 10/10 10/15 10/17 10/22 10/24 Intro Search Heuristic Search Constraint Sat. Satisfiability Sat. Encodings Local Search Game trees Catch up day Games of chance Markov Models Midterm Ch. 1 Ch. 3 [3.3, 3.5] Ch. 4 [4.1, 4.2] [3.7] Ch. 6 [6.4, ex. 6.15]
Ch. 4 [4.4], B. 3.1, B, [20.8] Ch. 5 [5.2, 5.3, 5.4]
[5.5]
Ch. 18 [18.3] Ch. 19 [19.3, 19.4] Ch. 15 [15.1, 15.2] Ch. 19 [19.6]