CIS 140: Artificial Intelligence Winter Quarter, 2008 Lectures: TTh 4-5:45pm in Phy Sci 136 Instructor: Robert Levinson Office Hours: W 4-6PM in 255 Applied Sciences , after class or by appointment. Phone number: 459-2087 E-mail:levinson@cse.ucsc.edu - Write me! Newsgroup: ucsc.class.cmp140 - Please read regularly! For fun, follow: comp.ai., rec.games.chess.computer Teaching Assistant: Ben Weber Office Hours: ?????? E-mail: bweber@soe.ucsc.edu Reader/Tutor: (mainly help with projects) Ryan Ferran: rferran@soe.ucsc.edu Prereqs: CIS101 and (cis106 or ce177 or math115 or CIS130 or instructors permission) Knowledge of predicate calculus (first order logic) is helpful, but not mandatory. The purpose of the prerequisites is to insure sophistication in handling graph and tree structures, or logic, or fundamentals of computation. You should have some previous exposure to recursion. ----------------------------- Required: Artificial Intelligence: A Modern Approach Russell and Norvig 2003 Publisher: Prentice Hall Second Edition call this "AI" Text is also used in CMPS240. Optional: ANSI Common Lisp (paul graham) for more practical examples: Practical Common Lisp - Peter Seibel The common lisp Bible and Language standard: Common Lisp, Second Edition: The Language Guy Steele, Second Edition Available on line: http://www.cs.cmu.edu/Groups/AI/html/cltl/clm/ Lisp 3rd Edition, Winston and Horn Used previous years: Artificial Intelligence Winston (3rd Edition) 1992 Addison Wesley Also on Line: A Gentle Introduction to Symbolic Computation David Touretsky http://www.cs.cmu.edu/~dst/LispBook/index.html (Also see On-Line Lisp Tutorials/Intros on World Wide Web. For example: http://www.apl.jhu.edu/~hall/lisp.html http://www-2.cs.cmu.edu/~ggordon/lisp-hints.txt http://www.csc.calpoly.edu/~gfisher/classes/530/handouts/ ---------------- READ ABOUT PRISONER DILEMMA type games at: http://en.wikipedia.org/wiki/Prisoner's_dilemma ---------------------------------------------------- Evaluation: Written Assignments 4 parts (HW1-HW4) Adaptive Programming Project (P1-P4) 4 Quizzes 4 30 minute exams Final exam 1 180 minute exam. YOU WILL BE SCORED 25-25-25-25 weighing all categories equally. Exceptional performance will be recognized (extra credit). Minimally, at least 45% must be achieved in each part to be even considered for passing the course. ---------------- Policies: Homework, programming assignments, and project assignments may be done in groups of 1 or 2 or 3 that remain steady throughout the quarter, and also must be turned in at class time (or other, if specifically announced). It is fine and encouraged to discuss homework problems and projects with other students - BUT CHEATING or ACADEMIC DISHONESTY on any course item (such as direct verbatim copying from a member outside your group or during an exam) will result in not passing the course and other highly undesirable consequences. No incompletes for the course will be given. ---------------- Notes: About 30-40% of the course material will be about Lisp. Prior familiarity is not assumed. In addition students will write "Adaptive Pattern-Oriented Game Players" in Lisp. The learning methodology used follows the instructor's model for experience-based learning and others. Tournaments may be run at various points in the quarter and up to 40% percent of your project grade will depend on your agent's performance. This year's games invented by the instructor are called "Lowball" and "Stocker". **************************************************************** *************************************************************** Running Lisp: cmucl On most cats machines like unix.ic: lisp or /usr/local/bin/lisp at Unix prompt (load "myfile") to load your file of functions and s-exprs. (quit) to exit or ^D to exit. Try to use cmucl if possible. But any Common Lisp might do. On soe.ucsc.machines you could use /usr/local/sbcl ********************************************************************** CMUCL USER'S MANUAL: http://www.cons.org/cmucl/doc/index.html ************************************************ Lecture and Assignment Schedule (Unless otherwise announced. A few changes should be expected.) -------------------------------------------------------------- Course Equation: Total Information = Diversity + Symmetry. Course Affirmation 1: Every day and in every way my agent and I are growing in intelligence and understanding. Course Affirmation 2: Exploiting mathematical structure is easy, rewarding and fun. HW1-HW4 are written and programming assignments. P1-P4ab are Project assignments. HW Exercises are from AI P1 is LISP exercises P2-P4 are project assignments and will be handed out in class. I. Introduction to AI and Lisp Programming Read Chapters 1,2.1-2.3 in AI. and 2,3,5,6,9 in the Lisp book. HW1= 1.9-1.13 (one paragraph each) , 2.3 (6 problems in all - due Thursday January 24 P1 = Problems 2,3,4,5a,6,7 from: http://www.apl.jhu.edu/~hall/AI-Programming/HW1-Review.html and Problems 1-5 from: http://www.apl.jhu.edu/~hall/AI-Programming/HW2-Higher-Order.html and problems 1,3-5 from: http://www.cs.northwestern.edu/academics/courses/325/exercises/lisp-exs.html (15 problems in all - due Thursday January 24) (17 problems - due Thurs. January 24) 1. (Tuesday January 8) 2. (Thursday January 10) 3. (Tuesday January 15) 4. (Thursday January 17) Quiz 1 5. (Tuesday January 22) 6. (Thursday January 24) Hw1 + P1 are due 7. (Tuesday January 29) II. Search and Heuristics Read Chapters 3 and 4.1-4.3 in AI HW2: 3.4, 3.12, 4.1,4.3,4.5, 4.7, 4.9 (7 problems in all - due Thursday Feb 7 P2: Project Phase II: Game monitors + simple agents due Thursday Feb. 7) 8. (Thursday January 31) Quiz 2 9. (Tuesday February 5) 10. (Thursay February 7) HW2 + P2 are due 11. (Tuesday February 12) 12. (Thursday February 14) Quiz 3 III. Knowledge Representation and Logic Read Chapters 7.3-7.6 and 8.1-8.3 and 9.1-9.2 and 9.5 in AI HW3: 7.4,7.6, 7.8, 7.9, 8.2,8.3, 8.7, 8.8, 9.3, 9.4 (10 problems in all - due Thurs. Feb 28) P3: Project Phase III: strategic agents (Due Thurs. Feb. 28) 13. (Tuesday February 19) 14. (Thursday February 21) Nothing is due :) IV. Machine Learning Read 19.1, 20.4,20.5 21.1-21.2 in AI HW4: 19.1, 19.4, 20.11, 20.13, 20.15 (4 problems) + Learning demo Due: Thurs. March 13. P4ab-: Project Phase IV (due Thurs. Mar 6 and Thurs. March 13) : learning agents 15. (Tuesday February 26) 16. (Thursday February 28) HW3 + P3 are due 17. (Tuesday March 4) 18. (Thursday March 6) Quiz 4 + P4a 19. (Tuesday March 11) 20. (Thursday. March 13) REVIEW. P4b is due. HW4 is due. Final Exam - Friday Mar. 21 4-7pm at class site. The final exam will be cumulative and will come from material in the lectures, readings, homework and programming problems, but will largely come from lecture. The exams may be open book, closed book, or take-home... But probably will be closed book.