A fast C++ impementation of Monte Carlo Tree Search with abstract classes that a user of this library can extend in order to use it. To demonstrate it I apply it to the game of Quoridor.
-
Updated
Sep 8, 2021 - C++
A fast C++ impementation of Monte Carlo Tree Search with abstract classes that a user of this library can extend in order to use it. To demonstrate it I apply it to the game of Quoridor.
Implementation of an AlphaGo Zero paper in one C++ header file without any dependencies
This is my entry winning CodeCup competition 2021 with the game Zuniq
An AI of hexagon gobang, using mcts
AI implementation using monte carlo tree search (MCTS) for the Game of Amazons
Work in Progress. Implementation of the Monte Carlo Tree Search, a decision making algorithm.
A Hex board game with a customizable Monte Carlo Tree Search (MCTS) agent with optional leaf parallelization in C++14. Includes a logging functionality for MCTS insights.
Add a description, image, and links to the mcts-implementations topic page so that developers can more easily learn about it.
To associate your repository with the mcts-implementations topic, visit your repo's landing page and select "manage topics."