mcts-agents
Here are 11 public repositories matching this topic...
An AI agent developed to play Ms. Pac-Man by adopting a strategy formed by MCTS and a FSM.
-
Updated
Jul 17, 2021 - C#
This is work-in-progress (WIP) refactored implementation of "Retreival-guided Reinforcement Learning for Boolean Circuit Minimization" work published in ICLR 2024.
-
Updated
May 10, 2024 - Verilog
AI implementation using monte carlo tree search (MCTS) for the Game of Amazons
-
Updated
Oct 13, 2023 - C++
Tic-tac-toe/"noughts & crosses" written in Clojure (CLI + deps). AI powered by Monte Carlo tree search algorithm
-
Updated
Aug 19, 2022 - Clojure
An AI agent for the card game Coup that uses ISMCTS.
-
Updated
Aug 28, 2023 - Python
A Hex board game with a customizable Monte Carlo Tree Search (MCTS) agent with optional leaf parallelization in C++14. Includes a logging functionality for MCTS insights.
-
Updated
Jun 5, 2023 - C++
Lightweight, extensible, and fair multi- DNN manager for heterogeneous embedded devices.
-
Updated
Jul 12, 2023 - Python
Using reinforcement learning to play games.
-
Updated
May 7, 2023 - Python
MiniMax with Alpha-Beta pruning and Monte-Carlo Tree Search implementations for the board game Hex
-
Updated
Jun 8, 2021 - Python
A Monte-Carlo Tree Search mathod that enables two agents interact and work together in the game of Pacman Capture the Flag.
-
Updated
Sep 19, 2023 - Python
Improve this page
Add a description, image, and links to the mcts-agents topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the mcts-agents topic, visit your repo's landing page and select "manage topics."