CMPS 140: Artificial Intelligence Winter Quarter, 2006 Lectures: TuTh 12-145pm Stevenson 175 Instructor: Robert Levinson Office Hours: W 4-8pm 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: Foaad Khosmood Office Hours: [All held at Crown-201 until further notice] Mo: 12-2PM Tu: 2-4PM We: 12-2PM Other times by appointment. E-mail: foaad@ucsc.edu Please include "[CS140]" in subject line. Reader/Tutor: (mainly help with projects) Andrew Trapani Email: atrapani@cats Prereqs: CIS101 and (cis106 or ce177 or math115 or CIS130 or instructors permission) Knowledge of predicate calculus 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 by Patrick Winston (3rd Edition) Recommended: ANSI Common Lisp (paul graham) OPTIONAL: Lisp 3rd EDition, Winston and Horn Prior text: Elaine Rich Knight, Kevin Artificial Intelligence., Second Edition! McGraw-Hill Book Co., New York, 1990. (The Bible:) Common Lisp the Language, 2nd edition by Guy L. Steele, Thinking Machines, Inc. Digital Press 1990 paperbound 1029 pages ISBN 1-55558-041-6 $39.95 Available on line: http://www.cs.cmu.edu/Groups/AI/html/cltl/clm/ (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.observatorio.unal.edu.co/virtual/lenguajes/lisp/nyu/ http://www.csc.calpoly.edu/~gfisher/classes/530/handouts/ For research level understanding: Artificial Intelligence: A Modern Approach Russell and Norvig 2003 Second edition ------------------------------ Draft Text on Scientific Thinking: A Systems Approach (optional) download pdf from "draft" link at: http://www.soe.ucsc.edu/%7Elevinson/ ---------------- READ ABOUT PRISONER DILEMMA type games at: http://en.wikipedia.org/wiki/Prisoner's_dilemma ---------------------------------------------------- Might help you with your Agent Projects: Calculated Bets Computers, Gambling and Mathematical Modelling to Win. Steven Skiena. 2001 Cambridge University Press check out the website: www.jai-tech.com Elementary Probability - David Stirzaker Cambridge University Press - 1994. An Introduction to Natural Computation Dana Ballard, The MIT Press, 1997. 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. 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. **************************************************************** Running Lisp: cmucl On most cats machines: lisp or /usr/local/bin/lisp at Unix prompt [ else perhaps: /usr/local/acl/lisp at Unix prompt.] (load "myfile") to load your file of functions and s-exprs. (quit) to exit or ^D to exit. There are slight differences between cmucl and acl, but we'll survive. Try to use cmucl if possible. ********************************************************************** CMUCL USER'S MANUAL: http://www.cons.org/cmucl/doc/index.html ************************************************ Downloading CMUCL: http://www.cons.org/cmucl/ ************************************************** 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 Winston, starting on page 627 P1 is from LISP (Graham). P2-P4 will be handed out in class. I. Introduction to AI and Lisp Programming Read Chapters 1-2 in Winston and 2,3,5,6,9 in LISP. HW1= write a 250 word essay agreeing or disagreeing with one of the statements in exercises 1.1-1.6. also do exercises 2.1-2.2. P1 = LISP: 2.2-2.7,2.9 3.3-3.5,5.1,5.2, ,6.6, 9.1,9.6 Due: Thursday January 19 1. (Thursday January 5) 2. (Tuesday January 10) 3. (Thursday January 12) Quiz 1 4. (Tuesday January 17) 5. (Thursday January 19) HW1 + P1 is due 6. (Tuesday January 24) 7. (Thursday January 26) Quiz 2 II. Search and Heuristics Read Chapters 3-6 HW2: 3.6, 4.1-4.5, 5.1, 5.2, 6.1-6.2, 6.5 P2: Project Phase II: Game monitors + simple agents due Thurs. Feb. 2 Due: Thursday, February 9 8. (Tuesday January 31) 9. (Thursday February 2) HW2 + P2 are due 10. (Tuesday February 7) 11. (Thursday February 9 Quiz 3 12. (Tuesday February 14) III. Knowledge Representation and Logic Read Chapters 7 and 13 HW3: 13.1-13.6 (Due thurs feb 23) P3: Project Phase III: strategic agents (Due Thurs. feb. 23) 13. (Thursday February 16) nothing is due... :) 14. (Tuesday February 21) IV. Machine Learning Read Chapters 16 and 19-23 HW4: 16.1-16.2, 19.2, 19.3, 19.5, 20.1-20.4, 21.2, 22.1-22.4 (due. Thu. March 9) P4ab-: Project Phase IV (due Thurs. Mar 9 and Thurs. March 16) : learning agents 15. (Thursday February 23) Hw3+P3 is due. 16. (Tuesday February 28) 17. (Thursday March 2) Quiz 4 18. (Tues. March 7) 19. (Thursday March 9) P4a + HW4 are due. 20. (Tues. March 14) 21. (Thursday March 16) REVIEW. P4b is due Final Exam - Tuesday Mar. 21 8-11am 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.