AnimalChessAnimal Fight Chess Game(斗兽棋) written in rust.
Stars: ✭ 76 (+484.62%)
Mutual labels: alpha-beta-pruning, monte-carlo-tree-search
boardgame-socketserverA generic board game socket server
Stars: ✭ 39 (+200%)
Mutual labels: board-game-framework
alpha sigmaA pytorch based Gomoku game model. Alpha Zero algorithm based reinforcement Learning and Monte Carlo Tree Search model.
Stars: ✭ 134 (+930.77%)
Mutual labels: monte-carlo-tree-search
gomoku-battleGomoku Battle is a cross-language cross-system battle platform.
Stars: ✭ 18 (+38.46%)
Mutual labels: alpha-beta-pruning
alphastoneUsing self-play, MCTS, and a deep neural network to create a hearthstone ai player
Stars: ✭ 24 (+84.62%)
Mutual labels: monte-carlo-tree-search
boardgame-socketplayerA generic board game socket client
Stars: ✭ 21 (+61.54%)
Mutual labels: board-game-framework
MyAlphaGoZeroOnConnect4My Simple Implementation of AlphaGo Zero on Connect4
Stars: ✭ 16 (+23.08%)
Mutual labels: monte-carlo-tree-search
HypernetsA General Automated Machine Learning framework to simplify the development of End-to-end AutoML toolkits in specific domains.
Stars: ✭ 221 (+1600%)
Mutual labels: monte-carlo-tree-search
connect-four-jsMinimax and Alpha-Beta Pruning implementations in JavaScript
Stars: ✭ 21 (+61.54%)
Mutual labels: alpha-beta-pruning
tic-tac-toe-jsNo description or website provided.
Stars: ✭ 20 (+53.85%)
Mutual labels: alpha-beta-pruning
checkersA game of checkers written using minmax algorithm and alpha-beta pruning.
Stars: ✭ 19 (+46.15%)
Mutual labels: alpha-beta-pruning
Alphazero gomokuAn implementation of the AlphaZero algorithm for Gomoku (also called Gobang or Five in a Row)
Stars: ✭ 2,570 (+19669.23%)
Mutual labels: monte-carlo-tree-search
Alpha Zero GeneralA clean implementation based on AlphaZero for any game in any framework + tutorial + Othello/Gobang/TicTacToe/Connect4 and more
Stars: ✭ 2,617 (+20030.77%)
Mutual labels: monte-carlo-tree-search
quoridor-aiQuoridor AI based on Monte Carlo tree search
Stars: ✭ 23 (+76.92%)
Mutual labels: monte-carlo-tree-search
MCTS-agent-pythonMonte 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 …
Stars: ✭ 22 (+69.23%)
Mutual labels: monte-carlo-tree-search
deep-active-inference-mcDeep active inference agents using Monte-Carlo methods
Stars: ✭ 41 (+215.38%)
Mutual labels: monte-carlo-tree-search
UCThelloUCThello - 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)
Stars: ✭ 26 (+100%)
Mutual labels: monte-carlo-tree-search
connect4Solving board games like Connect4 using Deep Reinforcement Learning
Stars: ✭ 33 (+153.85%)
Mutual labels: monte-carlo-tree-search