← Back to Projects

Pokemon Battle AI
assignmentactive projects
Java
this project implements a tree traversal ai agent for pokemon battles. the agent uses monte carlo tree search (mcts) with uct (upper confidence bound for trees) to make optimal move decisions during pokemon battles. the agent evaluates possible moves by building a game tree, performing simulations, and selecting moves that maximize expected reward.