Skip to content

Implementation of the Reversi board game, with an AI opponent that makes moves using the Monte Carlo tree search algorithm.

Notifications You must be signed in to change notification settings

anandrahul604/reversi-with-mcts

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Reversi with Monte Carlo tree search

Implementation of the Reversi board game, with an AI opponent that makes moves using the Monte Carlo tree search algorithm.

Game.java will allow you to play the reversi game against an AI opponent that makes it moves using the Monte Carlo tree search algorithm.

Simulation.java will run N simulations of the MCTS AI against a modified version of the MCTS AI. This modified version of the MCTS algorithm has additional logic included that should allow it to perform better than pure MCTS. The game is played N times to completion, and the results are shown for how many games each algorithm won.

About

Implementation of the Reversi board game, with an AI opponent that makes moves using the Monte Carlo tree search algorithm.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages