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

Unified Reinforcement Learning Framework

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

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

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 based playing strategies for the card game Durak

♟️ 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

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

Sentiment Analysis & Monte Carlo Tree Search with Nested Rollout Policy Adaptation for Business

python实现的五子棋小游戏

MCTS implementation for Fanorona board game agent.

Little program for MCTS and alpha-beta-pruning that can play connect4 against each other.

Reversi, a strategy board game.

Used the Monte Carlo Tree search for a tic tac toe robot that wont lose!

Advancing game performance through advanced AI algorithms and reinforcement learning for unmatched efficiency and adaptability.

We compare different policies for the checkers game using reinforcement learning algorithms.

An extended version of Tic-Tac-Toe, with the option to play against other humans or an AI agent

SUSTech CS311 Artificial Intelligence (H, Spring 2024) Project 1