A game of tablut where I implement the AI agent. I used a min-max tree based on 6 main heuristics to limit to the top 10 possible moves. I then used a Monte-Carlo tree search to evaluate and find the most optimal move.