CSE 473 - Introduction to Artificial Intelligence - Autumn 2016
Mon, Wed, Fri 9:30-10:20 in More 220
- Your grade will be 55% programming assignments, 15% midterm
and 30% final exam.
- Assignments will be done individually unless otherwise specified. You may discuss the subject matter with other students in the class,
but all final answers must be your own work. You are expected to maintain the utmost level of academic integrity in the course.
- Late policy: You are allowed to use 4 (actually, now 5) late days throughout the entire quarter for the programming assignments. It's upto you how you want to use these, so please plan accordingly. After this, assignments turned in late will incur a penalty of 20% in the final score, for each day (or part thereof). You must email the instructors (see "Communication") if you want to use a late day. By default, we will be grading the state of your code repository at the deadline.
Schedule, Reading & Lecture Slides
All this stuff is on the class CALENDAR
This quarter, we will do
Pac-Man Projects originally created by John DeNero and Dan Klein.
Please complete the versions listed below, as they differ in places
from the Berkeley versions. Use Python 2.x
See the calendar for details!
Midterm & Final Exam
Closed book; no calculators, but one 8.5 x 11" double-sided sheet of paper allowed.
Midterm: practice and (solutions); actual midterm exam and (solutions).
Final exam: practice and its (solutions); actual final exam and solutions
- Important class announcements will be made on both Canvas and class mailing list
cse473a_au16 @ uw.
- Class dicussion forum is on Canvas.
- Email for reaching instructors:
cse473-instr @ cs
Academic Honesty Policy
It is encouraged that you discuss your solutions with each other and consult online sources to better understand the material. However your code must be written entirely by yourself. As a rule, you should never look at or run anyone else's code for the assignment, whether the code was written by someone currently in the class, or someone who took it previously, even at another university.
Reading pseudocode for generic algorithms (like alpha-beta pruning or
A* search) is perfectly OK. If you use a source very closely, for
example, converting a pseudocode implementation of A* to python,
academic integrity demands that you cite the source (in a
comment). You will not be penalized for including such a comment; on the contrary, the
citation may help us to understand why your implementation is so
similar to someone else's, in case they use and cite the same source.
We do compare everyone's projects to each other and to past
submissions to detect logical redundancy. When two assignments are too
similar to have occurred by chance, we have to look into whether
something improper occurred. These investigations are not fun for
anyone involved, and we report all cases to the College of Engineering Dean's office.
So please, be careful to come up with your solutions
entirely independently. Plus, this is the best way to learn the material.