Project 3: Adversarial Search: CS 4013
- Due No Due Date
- Points 60
- Submitting a file upload
- File Types pdf
Before starting to work on this assignment, please view the Project Module (Links to an external site.).
Once you have looked over the project module, please utilize the Project 3 (Links to an external site.)(Links to an external site.)
This project will take 6-10 hours to complete. Note, as with the last project, graduate students have additional requirements.
By the end of this project, you will have accomplished the following objectives.
- Created an agent that can play games optimally using minimax (and alpha-beta pruning if you are a graduate student)
- Reused your code from the previous projects to allow the agent to effectively navigate around the environment and choose a gaming asteroid
- Compete on the class-wide competition ladder
Rubric
Find Rubric
Please include a title
Keep in mind that 26 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
--
|