Project 3: Adversarial Search: CS 5013
- Due No Due Date
- Points 80
- Submitting a file upload
- File Types pdf
Project 3 as described here Links to an external site.
Rubric
Find Rubric
Please include a title
Keep in mind that 8 students have already been assessed using this rubric. Changing it will affect their evaluations.
| 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
|
|
pts
--
|
||||||
|
Printouts or graphics
threshold:
pts
|
|
pts
--
|
||||||
|
Good coding practices
threshold:
pts
|
|
pts
--
|
||||||
|
Writeup: Minimax
threshold:
pts
|
|
pts
--
|
||||||
|
Writeup: path
Why did you choose the cooperative or competitive path? A sentence or two is sufficient here
threshold:
pts
|
|
pts
--
|
||||||
|
Alpha-beta pruning
threshold:
pts
|
|
pts
--
|
||||||
|
Late submission
threshold:
pts
|
|
pts
--
|
||||||
|
Total Points:
80
out of 80
|
||||||||