Programming Assignment #1

Project Description

Your objective for this assignment is to complete questions 1-8 from the Pac-Man search project. All files should be submitted through Blackboard. If you choose to work with a partner, you must notify me in advance, and you will submit just one copy of your solutions.

There are two due dates for this project:

• Question 1 is due Monday, September 17th. By that date you should submit a version of search.py that has a working implementation of depthFirstSearch.
• Working solutions to all questions are due Monday, September 24th. By that date you should submit completed versions of search.py and searchAgents.py. You must also submit a short (1-2 page) report addressing the following topics:
  • Describe the heuristic that you implemented for the corners search problem and provide an argument that your heuristic is admissible. Can you think of a better heuristic that you could apply if you had more time?
  • Describe the heuristic that you implemented for the food search problem and provide an argument that your heuristic is admissible. Can you think of a better heuristic that you could apply if you had more time?

Grading

Grades for this project will be calculated as follows:

Your code will be graded on the basis of correctness, clarity, and efficiency. (I will not necessarily follow the point distributions described in the body of the project.) Note that late submissions WILL NOT BE ACCEPTED for the first deadline. Note also that the code submitted for the second deadline will be graded separately from the code submitted for the first deadline. (In other words, Question 1 will be graded twice.)

Your report will be graded on the basis of content as well as style. Your writing should be clear, concise, well-organized, and grammatically correct.