[NeurIPS 2023 Spotlight] LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios

Unified Reinforcement Learning Framework

A Monte Carlo Tree Search AI for the game 2048

MCTS algorithm tutorial and it's explanation with code. Application of MCTS to create A.I for simple game.

Monte Carlo tree search (MCTS) on traveling salesman problem (TSP)

基于Qt的不围棋(nogo)单机对战平台，包含基于MCTS的AI对战Bot

In this project we try to create a sophisticated computer agent to play the Contact Bridge card game. Our goal is to develop an agent that is tough to play against, with fast reaction time so it is able to play in real time against humans. We approached this as a search problem, and implemented search-tree heuristics based on Minimax and Monte C…

mcts-simple is a Python3 library that allows reinforcement learning problems to be solved easily with its implementations of Monte Carlo Tree Search.

MCTS based playing strategies for the card game Durak

Monte Carlo tree search for the travelling salesman problem (MCTS for the TSP)

An eXplainable AI system to elucidate short-term speed forecasts in traffic networks obtained by Spatio-Temporal Graph Neural Networks.

An AI agent developed to play Ms. Pac-Man by adopting a strategy formed by MCTS and a FSM.

♟️ Deploy a AI five-in-a-row game. Including front-end, back-end & deep RL code. 基于 vue3 与 flask 部署的强化学习五子棋 AlphaGo 实践。

AI for the Connect 4 game

MCTS Pacman agent applied to the Pacman VS Ghosts conpetition framework

Reversi (Othello) AI game in C#. Using Monte Carlo Tree Search algorithm AND BTMM algorithm.

Tictactoe engine using Monte Carlo Tree Search

A tool on Taobao.com using Monte Carlo Tree Search to help make sensible shop plan📃, considering discount🏷, desiring score💗 and budget💳, etc.

Companion repository of the "Dancer in the Dark" paper.

Monte Carlo Tree Search in C++