MiniMax with Alpha-Beta pruning and Monte-Carlo Tree Search implementations for the board game Hex
-
Updated
Jun 8, 2021 - Python
#
mcts-agents
Here are 8 public repositories matching this topic...
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
Adaptive Advanced Tree Search function designed for OpenWeb-UI
-
Updated
Apr 26, 2025 - Python
Every LLM invocation is wrapped with a Monte Carlo Tree Search (MCTS) pipeline. Served as a OpenAI compatible API server.
-
Updated
May 22, 2025 - Python
Lightweight, extensible, and fair multi- DNN manager for heterogeneous embedded devices.
deep-neural-networks deep-learning scheduler python3 pytorch embedded-systems performance-prediction workload-automation edge-inference mcts-agents heterogeneous-architectures concurrent-execution throughput-estimation
-
Updated
Jul 12, 2023 - Python
An AI agent for the card game Coup that uses ISMCTS.
-
Updated
Aug 28, 2023 - Python
Using reinforcement learning to play games.
game python games reinforcement-learning ai python3 artificial-intelligence mcts reinforcement-learning-algorithms artificial-neural-networks python-3 monte-carlo-tree-search reinforcement-learning-agent mcts-implementations rl-algorithms reinforcement-learning-environments mcts-algorithm mcts-agents
-
Updated
May 7, 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."