Project 1: Uninformed Search CS4013
- Due No Due Date
- Points 100
- Submitting a file upload
- File Types pdf
Before starting to work on this assignment, please view the Project Module .
Once you have looked over the project module, please utilize the Project 1 (Links to an external site.) page for detailed instructions on completing Project 1.
This project will take 6-10 hours to complete (this includes time getting familiar with the existing codebase, which is important for your long-term learning as you will be using existing code bases in whatever your future job is!). Note that graduate students will need to implement two searches.
By the end of this project, you will have accomplished the following objectives.
- Create an agent that moves around the board intelligently using uninformed search
- Implement uninformed search in a real-world environment
- Become familiar with implementing agents in an existing codebase
- Compete on the class-wide competition ladder
Rubric
Find RubricKeep in mind that 29 students have already been assessed using this rubric. Changing it will affect their evaluations.
| Criteria | Ratings | Pts | |||||||
|---|---|---|---|---|---|---|---|---|---|
|
BFS/DFS
CS4013 students need only to implement ONE of BFS or DFS.
threshold:
pts
|
|
pts
--
|
|||||||
|
Graphics
Correctly drawing graphics that enable you to debug your search and that help us to grade it. This means you should display your graph either all at once (if you initialize it that way) or step-by-step as it is built. You should also show the path found by BFS/DFS that your ship will traverse
threshold:
pts
|
|
pts
--
|
|||||||
|
Replanning
Dynamically replanning as needed in an efficient manner. This CANNOT be replanning every time step
threshold:
pts
|
|
pts
--
|
|||||||
|
Good coding practices
We will randomly choose from one of the following good coding practices to grade for these 15 points. Note that this will be included on every project. Are your files well commented? Are your variable names descriptive (or are they all i, j, and k)? Do you make good use of classes and methods or is the entire project in one big flat file?
threshold:
pts
|
|
pts
--
|
|||||||
|
Writeup part 1
Describe how you implemented search (gridded, roadmap, etc) and how you dealt with the dynamics of the environment
threshold:
pts
|
|
pts
--
|
|||||||
|
Writeup part 2
Why did you choose the cooperative or competitive path? A sentence or two is sufficient here
threshold:
pts
|
|
pts
--
|
|||||||
|
Total Points:
100
out of 100
|
|||||||||