Rubric

Find Rubric
Keep in mind that 12 students have already been assessed using this rubric. Changing it will affect their evaluations.
Project 1: Uninformed Search: CS 5013
Project 1: Uninformed Search: CS 5013
Criteria Ratings Pts
BFS/DFS
CS 5013 students will need to implement a second uninformed search method from BFS, DFS, IDFS, or other uninformed search method from the book.
threshold: pts
40 pts
Full Marks
correctly implementing TWO uninformed search methods. A correct player will move to the target beacons as efficiently as possible . The ship will rarely run into obstacles, other ships, or bullets. Full credit requires FULL code documentation explaining what each function does. The top of each java file should also contain a 2-3 sentence description of everything that java file does
35 pts
Minor mistakes
30 pts
Multiple minor mistakes or missing documentation
20 pts
One major mistake or only implementing one method for 5013
15 pts
Several major mistakes
5 pts
An agent that does something (but does not search)
0 pts
No Marks
pts
40 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
15 pts
Full Marks
10 pts
Some bugs
5 pts
Major bugs
0 pts
No Marks
pts
15 pts
--
Replanning
Dynamically replanning as needed in an efficient manner. This CANNOT be replanning every time step
threshold: pts
5 pts
Full Marks
2 pts
Replanning only when target reached
0 pts
No Marks
pts
5 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
15 pts
Full Marks
Well commented code, descriptive variables names or making good use of classes and methods
8 pts
Missing some aspect of good coding practices
0 pts
No Marks
pts
15 pts
--
Writeup part 1
Describe how you implemented search (gridded, roadmap, etc) and how you dealt with the dynamics of the environment
threshold: pts
7 pts
Full Marks
3.5 pts
Missing aspects of the writeup
0 pts
No Marks
pts
7 pts
--
Writeup part 2
Why did you choose the cooperative or competitive path? A sentence or two is sufficient here
threshold: pts
4 pts
Full Marks
0 pts
No Marks
pts
4 pts
--
Target choice
threshold: pts
5 pts
Full Marks
choosing effective targets to go to. This includes beacons, stars, asteroids, bases, etc. The targets should be chosen to achieve the goals of your team, as specified in the writeup. They should not just be a copy of one of the example agents.
2 pts
random
random targets that are not copied from the example agents
0 pts
No Marks
pts
5 pts
--
Writeup part 3: target choice
Describe how you selected your targets (e.g. why you choose a beacon versus an asteroid and when you make each choice). This should be short, essentially describing your logic of why you chose the targets and how they accomplish the goals you wanted to achieve for your agent.
threshold: pts
4 pts
Full Marks
0 pts
No Marks
pts
4 pts
--
Late submission
threshold: pts
0 pts
Late submission
0 pts
Submitted in time
pts
0 pts
--
Total Points: 95 out of 95