All Categories → No Category → monte-carlo-tree-search

Top 13 monte-carlo-tree-search open source projects

Alpha Zero General
A clean implementation based on AlphaZero for any game in any framework + tutorial + Othello/Gobang/TicTacToe/Connect4 and more
MCTS-agent-python
Monte Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree accordingly. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be represented as trees of sequential decisions, particularly games …
UCThello
UCThello - a board game demonstrator (Othello variant) with computer AI using Monte Carlo Tree Search (MCTS) with UCB (Upper Confidence Bounds) applied to trees (UCT in short)
ludorum.js
A board game framework, focused not on graphics or user interfaces, but on artificial players design, implementation and testing.
alpha sigma
A pytorch based Gomoku game model. Alpha Zero algorithm based reinforcement Learning and Monte Carlo Tree Search model.
alphastone
Using self-play, MCTS, and a deep neural network to create a hearthstone ai player
1-13 of 13 monte-carlo-tree-search projects