Your objective for this assignment is to complete questions 1-8 from the Pac-Man search project. If you choose to work with a partner, you must use a shared repository on Github. It will not be possible to select a partner after the initial project groups are created.
There are two due dates for this project:
search.py
that has a working
implementation of depthFirstSearch
. NOTE:
It sometimes make sense to use recursion to implement
depth-first graph traversals. In this
case, don't. Use a stack to store the nodes on
the frontier. Your submission for this first deadline
should be made through Canvas.
search.py
and
searchAgents.py
. You must also submit a
short (1-2 page) report addressing the following topics:
Grades for this project will be calculated as follows:
Solution for Question 1 (Submitted by first deadline) | 10% |
All Solutions (Submitted by second deadline) | 70% |
Appropriate use of version control | 10% |
Report | 10% |
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.
You should make regular commits to your git repository as you make progress on the project. At a minimum you should commit your code after completing each exercise.