A python implementation of 5x5 Tic-Tac-Toe, with an AI Opponent that utilizes either the Minimax or the Monte-Carlo Tree Search algorithms.
For UAF CS605 Artificial Intelligence, Spring 2021
Currently rated by pylint at an X/10, because it's impossible for me to not optimize a score.