masouduut94 / MCTS-agent-python
Monte Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree accordingly. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be represented as trees of sequential decisions, particularly games …
☆68Updated last year
Alternatives and similar repositories for MCTS-agent-python
Users that are interested in MCTS-agent-python are comparing it to the libraries listed below
Sorting:
- MONTE Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space…☆13Updated 4 years ago
- Cellular Automata Environments for Reinforcement Learning☆43Updated 2 months ago
- Simple Grid Environment for Gymnasium☆57Updated 2 months ago
- General Python implementation of Monte Carlo Tree Search for the use with Open AI Gym environments.☆40Updated 4 years ago
- Level-based Foraging (LBF): A multi-agent environment for RL☆180Updated 8 months ago
- A categorised list of Multi-Agent Reinforcemnt Learning (MARL) papers☆51Updated 2 years ago
- fast + parallel AlphaZero in JAX☆96Updated 4 months ago
- A collection of Deep Reinforcement Learning algorithms implemented with PyTorch to solve Atari games and classic control tasks like CartP…☆111Updated last year
- DQN-Atari-Agents: Modularized & Parallel PyTorch implementation of several DQN Agents, i.a. DDQN, Dueling DQN, Noisy DQN, C51, Rainbow,…☆123Updated 4 years ago
- Series of deep reinforcement learning algorithms 🤖☆29Updated 3 years ago
- A fast, generalized, and modified implementation of Deepmind's distinguished AlphaZero in PyTorch.☆76Updated 5 months ago
- Datasets with baselines for offline multi-agent reinforcement learning.☆167Updated this week
- A collection of pre-trained RL agents using Stable Baselines3☆127Updated 6 months ago
- Emergence of complex strategies through multiagent competition☆44Updated 2 years ago
- 🌳 Python implementation of single-player Monte-Carlo Tree Search.☆62Updated 3 years ago
- A simple implementation of MuZero algorithm for connect4 game☆97Updated 4 years ago
- A clean implementation of MuZero and AlphaZero following the AlphaZero General framework. Train and Pit both algorithms against each othe…☆158Updated 4 years ago
- Tabular methods for reinforcement learning☆37Updated 4 years ago
- Proximal Policy Optimization(PPO) with Intrinsic Curiosity Module(ICM)☆140Updated 6 years ago
- Experimentation with Regularized Nash Dynamics on a GPU accelerated game☆47Updated 2 years ago
- Partially Observable Process Gym☆189Updated 10 months ago
- The absolute most basic example of AlphaZero and Monte Carlo Tree Search I could come up with☆212Updated 2 years ago
- Benchmarks for Multi-Objective Multi-Agent Decision Making☆89Updated 2 months ago
- A project that provides help for using DeepMind's mctx on gym-style environments.☆59Updated 6 months ago
- Gridworld environments for OpenAI gym.☆80Updated last year
- Code for Gym documentation website☆43Updated last year
- A simple and highly efficient RTS-game-inspired environment for reinforcement learning (formerly Gym-MicroRTS)☆252Updated 10 months ago
- A reinforcement leaning environment for discrete MDPs.☆22Updated 6 months ago
- An API conversion tool for popular external reinforcement learning environments☆165Updated 4 months ago
- Proximal Policy Optimization (Continuous Version) in PyTorch.☆28Updated this week