COMP30024 - Artificial Intelligence
Building AI for the board game Tetress: an A* search for single-player puzzles, then a Monte Carlo Tree Search agent that plays against other agents.
0 likes1 view
This subject covered search, game playing and other classic AI techniques, with two Python projects on the board game Tetress.
In Part A, which I worked on with Gaoyongle Zhang, we used A* search to solve single-player Tetress puzzles. In Part B we built agents that play each other: a random baseline, an experimental "game within a game" agent, and our main agent using Monte Carlo Tree Search, profiled and tuned to play within the time and memory limits, plus a report on our approach.