mcts-algorithm
Here are 92 public repositories matching this topic...
Language:All
Sort:Most stars
[NeurIPS 2023 Spotlight] LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios (awesome MCTS)
- Updated
Dec 18, 2025 - Python
Unified Reinforcement Learning Framework
- Updated
Sep 6, 2024 - Python
SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQL
- Updated
May 23, 2025 - Python
Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search".
- Updated
May 20, 2025 - C
MCTS algorithm tutorial and it's explanation with code. Application of MCTS to create A.I for simple game.
- Updated
Mar 20, 2025 - Ruby
mcts-simple is a Python3 library that implements Monte Carlo Tree Search and its variants to solve a host of problems, most commonly for reinforcement learning.
- Updated
Aug 8, 2025 - Python
A Monte Carlo Tree Search AI for the game 2048
- Updated
May 24, 2020 - Java
An eXplainable AI system to elucidate short-term speed forecasts in traffic networks obtained by Spatio-Temporal Graph Neural Networks.
- Updated
Feb 23, 2024 - Jupyter Notebook
Monte Carlo tree search (MCTS) on traveling salesman problem (TSP)
- Updated
Apr 27, 2019 - Python
Companion repository of the "Dancer in the Dark" paper.
- Updated
Jul 13, 2024 - TypeScript
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…
- Updated
Aug 22, 2020 - Python
为 RWKV 设计的「Deep Think」实现。
- Updated
Dec 7, 2025 - Python
Monte Carlo tree search for the travelling salesman problem (MCTS for the TSP)
- Updated
Jun 18, 2022 - OCaml
MCTS based playing strategies for the card game Durak
- Updated
Jan 24, 2023 - Python
♟️ Deploy a AI five-in-a-row game. Including front-end, back-end & deep RL code. 基于 vue3 与 flask 部署的强化学习五子棋 AlphaGo 实践。
- Updated
Mar 16, 2022 - Python
An AI agent developed to play Ms. Pac-Man by adopting a strategy formed by MCTS and a FSM.
- Updated
Jul 17, 2021 - C#
MCTS Pacman agent applied to the Pacman VS Ghosts conpetition framework
- Updated
Mar 28, 2019 - Java
AI for the Connect 4 game
- Updated
May 26, 2019 - Python
Reversi (Othello) AI game in C#. Using Monte Carlo Tree Search algorithm AND BTMM algorithm.
- Updated
May 31, 2021 - C#
Improve this page
Add a description, image, and links to themcts-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with themcts-algorithm topic, visit your repo's landing page and select "manage topics."