A Monte Carlo Tree Search AI for the game 2048
-
Updated
May 24, 2020 - Java
A Monte Carlo Tree Search AI for the game 2048
MCTS Pacman agent applied to the Pacman VS Ghosts conpetition framework
Simulation about delivery route using a few methods to get the lowest cost.
In this project, my primary goal was to implement an AI player class powered by the Monte Carlo Tress Search algorithm which can play for a win as well as defend a defeat to compete with a Human player.
model-based RL solvers for some card games
Tic-Tac-Toe game using the Monte Carlo Tree Search algorithm, implemented in Java.
Cranes problem with Monte Carlo Tree Search algorithm
Add a description, image, and links to the mcts-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the mcts-algorithm topic, visit your repo's landing page and select "manage topics."