CMSC373 Artificial Intelligence
Assignment#5 (Due on Monday, November 15, 2021)
Analysis of Konane Game Trees
Perform an in-depth analysis of the Konane game tree using your implementation from Assignment#4. We want to know the following:
- Estimate the average branching factor of Konane. This is best done using the random move making version of your program.
- How many static evaluations are performed in a game using the Minimax algorithm. Do this for varying the depth of search starting at depth 2..N (where N is at least 6 or more levels).
- How many static evaluations are performed in a game using the Minimax + Alpha-Beta Pruning algorithm. Do this for varying the depth of search starting at depth 2..N (where N is at least 6 or more).
For each of the above, use at least three runs of your programs to get the data to confirm the numbers. Record the data in tables. When the numbers you have are in the same range, use data from one run to do the plots. For #2 and #3 above, plot the results obtained.
What to hand in:
A complete written report presenting the data and plots obtained along with a discussion of the results in the form of an analysis.
Back to CMSC373 webpage