| Instructor: | Jerod Weinman |
| Office: | Noyce 3825 |
| Phone: | x9812 |
| E-mail: | [weinman] |
| Mentors: | Reilly Grant (Section 1) |
| Prabir Pradhan (Section 2) |
Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, Third Edition. Prentice Hall, 2010. ISBN: 978-0-13-604259-4.The authors have updated this text on average only every 6.5 years. Thus, you should expect meaningful differences that represent significant improvements between editions. You should not attempt to use a previous edition. Our programming exercises will be (mostly) done in Scheme. An excellent Scheme reference/textbook is available free online, but a print edition is also available (you may also find an older copy in the CS Learning Center/MathLAN Library). We'll be using R5RS for this course.
R. Kent Dyvbig. The Scheme Programming Language, Third Edition. MIT Press, 2003. ISBN: 978-0262541480. http://www.scheme.com/tspl3Some additional programming exercises will be conducted in C. You may wish to refer to the following free online or print reference manuals.
Eric Huss, The C Library Reference Guide, University of Illinois Student Chapter, 1997. http://www.acm.uiuc.edu/webmonkeys/book/c_guide Samuel P. Harbison and Guy L. Steel. C: A Reference Manual, Fifth Edition. Prentice Hall, 2002. ISBN 0-13-08952-X Brian W. Kernighan and Dennis M. Ritchie. The C Programming Languag, Second Edition, Prentice Hall, 1988. ISBN 0-13-110362-8 (paperback), 0-13-110370-9 (hardback). K. N. King, C Programming: A Modern Approach, Second Edition, W. W. Norton, 2008, ISBN 978-0393979503.
| Week | Topic | Week | Topic | |
| 1 | Intelligent Agents | 8 | Bayesian Networks | |
| 2 | Search | 9 | Learning | |
| 3 | Heuristic Search | 10 | Decision Trees | |
| 4 | Adversarial Search | 11 | Decision Theory | |
| 5 | Propositional Logic | 12 | Markov Decision Processes | |
| 6 | First-Order Logic | 13 | Reinforcement Learning | |
| 7 | Probability | 14 | Philosophy of AI |
| PLUS | Exhibits exceptional clarity, insight and/or creativity. |
| CHECK | Exhibits evidence of processing and studying concepts. |
| MINUS | Superficial response or insufficient evidence of engagement. |
| Hour Exam 1 | Friday 23 February |
| Hour Exam 2 | Friday 16 March |
| Hour Exam 3 | Friday 20 April |
| Final Exam | TBD |
| Programming Assignments | 35% |
| Participation | 10% |
| Reading Journal | 15% |
| Exams | 30% |
| Final Exam | 10% |
| Average at least | Receives | Grade Points | Definition |
| 3.75 | A | 4.00 | Excellent |
| 3.50 | A- | 3.67 | Excellent |
| 3.16 | B+ | 3.33 | Good |
| 2.83 | B | 3.00 | Good |
| 2.50 | B- | 2.67 | Good |
| 2.16 | C+ | 2.33 | Satisfactory |
| 1.50 | C | 2.00 | Satisfactory |
| 0.50 | D | 1.00 | Passing |
| 0.00 | F | 0.00 | Failing |
"[Person X] helped me to do [thing Y] by [explaining Z]."