Alternatives and similar repositories for gomcts:

Users that are interested in gomcts are comparing it to the libraries listed below

• gorgonia / agogo
  A reimplementation of AlphaGo in Go (specifically AlphaZero)
  ☆216Updated 4 years ago
• ImparaAI / monte-carlo-tree-search
  Library for running a Monte Carlo tree search, either traditionally or with expert policies
  ☆124Updated last year
• tmoer / alphazero_singleplayer
  Single player Alpha Zero implementation
  ☆42Updated 3 years ago
• facebookresearch / Hanabi_SPARTA
  Research code implementing the search AI agent for Hanabi, as well as a web server so people can play against it
  ☆128Updated last year
• int8 / monte-carlo-tree-search
  Monte carlo tree search in python
  ☆600Updated 2 years ago
• pbenner / autodiff
  Autodiff is a numerical library for the Go programming language that supports automatic differentiation. It implements routines for linea…
  ☆55Updated 3 years ago
• klokare / evo
  Go implementation of NeuroEvolution of Augmenting Topologies (NEAT)
  ☆33Updated 6 years ago
• johan-gras / MuZero
  A structured implementation of MuZero
  ☆204Updated 2 years ago
• ccssmnn / hego
  Metaheuristics / Blackbox Optimization Algorithms for Go: Simulated Annealing, Genetic Algorithm, Ant Colony Optimization, Tabu Search, P…
  ☆55Updated 3 years ago
• soypat / godesim
  ODE system solver made simple. For IVPs (initial value problems).
  ☆23Updated 2 years ago
• Zeta36 / muzero
  A simple implementation of MuZero algorithm for connect4 game
  ☆97Updated 4 years ago
• cgreer / alpha-zero-boosted
  A "build to learn" Alpha Zero implementation using Gradient Boosted Decision Trees (LightGBM)
  ☆86Updated last month
• kaesve / muzero
  A clean implementation of MuZero and AlphaZero following the AlphaZero General framework. Train and Pit both algorithms against each othe…
  ☆157Updated 4 years ago
• jbradberry / mcts
  Board game AI implementations using Monte Carlo Tree Search
  ☆183Updated 5 years ago
• yaricom / goNEAT
  The GOLang implementation of NeuroEvolution of Augmented Topologies (NEAT) method to evolve and train Artificial Neural Networks without …
  ☆77Updated 4 months ago
• aunum / gold
  Reinforcement Learning in Go
  ☆350Updated 4 years ago
• pbsinclair42 / MCTS
  A simple package to allow users to run Monte Carlo Tree Search on any perfect information domain
  ☆222Updated 10 months ago
• int8 / regret-matching
  Simple implementation of regret matching algorithm for RPS nash equilibrium computation via self-play
  ☆25Updated 6 years ago
• brilee / python_uct
  Demo of UCT (MCTS) in Python / Numpy
  ☆85Updated 2 years ago
• JoshVarty / AlphaZeroSimple
  The absolute most basic example of AlphaZero and Monte Carlo Tree Search I could come up with
  ☆211Updated 2 years ago
• liuanji / WU-UCT
  A novel parallel UCT algorithm with linear speedup and negligible performance loss.
  ☆118Updated 4 years ago
• Kautenja / playing-mario-with-deep-reinforcement-learning
  An implementation of (Double/Dueling) Deep-Q Learning to play Super Mario Bros.
  ☆71Updated 4 years ago
• gnboorse / centipede
  Constraint Satisfaction Problem Solver for Golang
  ☆65Updated 2 years ago
• d4l3k / go-bayesopt
  A library for doing Bayesian Optimization using Gaussian Processes (blackbox optimizer) in Go/Golang.
  ☆50Updated 10 months ago
• MaxHalford / eaopt-examples
  eaopt examples
  ☆28Updated 6 years ago
• kirarpit / connect4
  Solving board games like Connect4 using Deep Reinforcement Learning
  ☆33Updated 2 years ago
• rqme / neat
  Go implementation of NEAT
  ☆11Updated 8 years ago
• int8 / counterfactual-regret-minimization
  Counterfactual regret minimization algorithm for Kuhn poker
  ☆171Updated 6 years ago
• ChristopherRabotin / ode
  An ordinary differential equation solving library in golang.
  ☆22Updated 8 years ago
• EricSteinberger / DREAM
  Scalable implementation of DREAM - Deep RL for multi-agent imperfect information games
  ☆115Updated 9 months ago