I developed this agent for the final project of the Artificial Intelligence course as a TA. We organized the final project as a competition, similar to Chillin-Wars 2020, where students developed agents to play games and compete with. We needed agents for students to compete with, and if they could defeat these agents, we gave them a score.
Our agent for the Tron game utilizes a combination of the genetic algorithm and minimax for decision-making. Here are the key statements of our approach:
- We have a minimax tree with a fixed max depth size as a hyper-parameter.
- We have also a genetic population. our individuals represent paths in the minimax tree.
- Define fitness for each path and then, select some individuals as parents and make the next generation by them with the mutation probability of 0.1. (as a hyper-parameter)
- Finally, we find the best path as the best individual. and the best action we choose for the next state is the first node of the best individual. (it means we analyze the fitness of the next n steps n and choose the path which gives us better fitness. And then, choosing the first action of that path as the minimax algorithm says.)
This approach represents a combined AI-based algorithm, leveraging the power of both genetic algorithms and minimax to enhance decision-making in the Tron game.
Here is the problem description in detail: link
And here is the result on ChillinMonitor:
- both agents are using this AI-based code.
Here is the repository of the First Place in this competition: link =))