Rubric

Find Rubric
Keep in mind that 17 students have already been assessed using this rubric. Changing it will affect their evaluations.
Project 3: Adversarial Search: CS 5013
Project 3: Adversarial Search: CS 5013
Criteria Ratings Pts
Minimax
correctly implementing Minimax search for 3D Tic Tac Toe. A correct player will win the game against the game asteroids if it is the first player (since 3x3x3 3D Tic Tac Toe is solved for the first player win) and will do so using Minimax search. A correct player will also ensure it goes to the gaming asteroids to play against them. 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.
threshold: pts
30 pts
Full Marks
25 pts
Minor mistake or missing some documentation
20 pts
Several minor mistakes or missing a lot of documentation
15 pts
Major mistake
5 pts
Major issues
Several major mistakes or if you implement a search other than Minimax that at least tries to play the game intelligently and is not just a re-use of the provided heuristic agent.
0 pts
No Marks
pts
30 pts
--
Printouts or graphics
threshold: pts
10 pts
Full Marks
7 pts
Minor bugs
3 pts
Lots of bugs
0 pts
No Marks
pts
10 pts
--
Good coding practices
threshold: pts
10 pts
Full Marks
well commented code, descriptive variables names or making good use of classes and methods
5 pts
Poor coding practices
partially commented code, semi-descriptive variable names, or partial use of classes and methods
0 pts
No Marks
pts
10 pts
--
Writeup: Minimax
threshold: pts
8 pts
Full Marks
Describe how you implemented minimax
4 pts
Missing description
0 pts
No Marks
pts
8 pts
--
Writeup: path
Why did you choose the cooperative or competitive path? A sentence or two is sufficient here
threshold: pts
2 pts
Full Marks
0 pts
No Marks
pts
2 pts
--
Alpha-beta pruning
threshold: pts
20 pts
Full Marks
15 pts
Minor errors
10 pts
Major error
5 pts
multiple major errors
0 pts
No Marks
pts
20 pts
--
Total Points: 80 out of 80