MCTS is a Monte Carlo Tree Search implementation.
-
Updated
Apr 10, 2019 - Go
#
monte-carlo-tree-search
Here are 7 public repositories matching this topic...
Package mcts provides parallel monte-carlo tree search for your Go applications.
-
Updated
Aug 2, 2023 - Go
the full monte - a generic MCTS library for game AIs with (planned) concurrency and network support
-
Updated
Dec 20, 2018 - Go
Othello AI using Monte Carlo Tree Search Algorithm
-
Updated
Dec 26, 2019 - Go
Code for my bachelor thesis "Using Monte Carlo tree search and machine learning to learn a heuristic function"
hex
machine-learning
linear-regression
bachelor-thesis
alpha-beta-pruning
monte-carlo-tree-search
hex-game
minimax-algorithm
-
Updated
Jan 22, 2019 - Go
Tic-tac-toe variant squava, with various methods of computer play
-
Updated
Jun 29, 2024 - Go
Improve this page
Add a description, image, and links to the monte-carlo-tree-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the monte-carlo-tree-search topic, visit your repo's landing page and select "manage topics."