An implementation of Monte Carlo Tree Search for Domineering written for a competition organized by Johannes stöhr.
-
Updated
May 26, 2020 - Java
An implementation of Monte Carlo Tree Search for Domineering written for a competition organized by Johannes stöhr.
This contains the code for our paper: Domineering games with minimal number of moves.
Domineering game with Monte Carlo Tree Search
Add a description, image, and links to the domineering topic page so that developers can more easily learn about it.
To associate your repository with the domineering topic, visit your repo's landing page and select "manage topics."