ReinforcementLearning.jl
open_spiel
ReinforcementLearning.jl | open_spiel | |
---|---|---|
2 | 44 | |
566 | 4,004 | |
1.6% | 0.9% | |
8.7 | 9.5 | |
16 days ago | 2 days ago | |
Julia | C++ | |
GNU General Public License v3.0 or later | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ReinforcementLearning.jl
-
What framework would you recommend to build a Tetris game AI using reinforcement learning?
I has a look to Julia too. There are nice tools build by JuliaDynamics. I.e. Agents.jl for agent based modeling. It handles collisions. There is also a framework for reinforcement learning. Also for Genetic Algorithms. Then I found a set of libraries related to Geometry. But it seems to be a lot of work to put that together for my use case.
-
Any tutorial on how to create RL C++ environments?
And I know it's another language, but Julia has made significant strides in their RL packages and are pretty easy to integrate with Python
open_spiel
-
What projects or open-source contributions can impress Jane Street recruiters for a Quant SWE role ?
Deep mind actually has a repository where they applied this algorithm for incomplete-knowledge games. You could use it for reference: https://github.com/deepmind/open_spiel/tree/master/open_spiel/python/algorithms
-
I want to build a learning agent for a combinatorial game
+1. You can also find an implementation of Clobber and AlphaZero (and many other basic RL algorithms) in OpenSpiel: https://github.com/deepmind/open_spiel
-
minimax for imperfect-information turn-games?
You can find a lot of code online if you look, and many of these applied to Poker. There's a general implementation of both in Python and C++ in OpenSpiel, with some examples applied to small poker games. It's nice code to learn from because the algorithms operate over generic game descriptions, so there aren't game-specific design choices mixed up with the implementation of the algorithms, and you can create your own poker game and just run them on it.
-
OpenSpiel 1.3 Released!
And many other additions and improvements. See all the details here: https://github.com/deepmind/open_spiel/releases/tag/v1.3
-
What's a good OpenAI Gym Environment for applying centralized multi-agent learning using expected SARSA with tile coding?
I would checkout the openspiel package. It's main focus is RL in games (multi-agent environments). You'll find RL examples there and games that are small enough to solve without deep RL. There's also a wide range of environments from fully cooperative to adversarial zero-sum.
-
Competitive reinforcement learning for turn-based games
Hi, you can check out OpenSpiel: https://github.com/deepmind/open_spiel/
-
Reinforcement learning and Game Theory a turn-based game
as for algorithms , openspiel repository has few implementations some of these are not related to imperfect information games , and others are not for multiagent environment and others are tabular algorithms .
-
Shimmy 1.0: Gymnasium & PettingZoo bindings for popular external RL environments
This includes single-agent Gymnasium wrappers for DM Control, DM Lab, Behavior Suite, Arcade Learning Environment, OpenAI Gym V21 & V26. Multi-agent PettingZoo wrappers support DM Control Soccer, OpenSpiel and Melting Pot. For more information, read the release notes here:
-
How to deal with situations where the RL agent cannot act at every time step?
I've had some success using Action Masking - you can refer to here https://github.com/deepmind/open_spiel/blob/120420a74a69354d64c10b51cd129d4587f9f325/open_spiel/python/algorithms/dqn.py but for DQN you need to mask out q values for invalid actions (as well as masking them during prediction). In my case I'm able to place my mask in the observation so can fetch it quite easily during prediction but if that's not possible you could query it from the environment and store it in the replay buffer (like they do in the link I shared)
-
How to search the game tree with depth-first search?
Take a look at this simple implementation: https://github.com/deepmind/open_spiel/blob/master/open_spiel/algorithms/minimax.cc
What are some alternatives?
Agents.jl - Agent-based modeling framework in Julia
muzero-general - MuZero
NetLogo - turtles, patches, and links for kids, teachers, and scientists
PettingZoo - An API standard for multi-agent reinforcement learning environments, with popular reference environments and related utilities
tiny-differentiable-simulator - Tiny Differentiable Simulator is a header-only C++ and CUDA physics library for reinforcement learning and robotics with zero dependencies.
gym - A toolkit for developing and comparing reinforcement learning algorithms.
procgen - Procgen Benchmark: Procedurally-Generated Game-Like Gym-Environments
rlcard - Reinforcement Learning / AI Bots in Card (Poker) Games - Blackjack, Leduc, Texas, DouDizhu, Mahjong, UNO.
RustyNEAT - Rust implementation of NEAT algorithm (HyperNEAT + ES-HyperNEAT + NoveltySearch + CTRNN + L-systems)
gym-battleship - Battleship environment for reinforcement learning tasks
brax - Massively parallel rigidbody physics simulation on accelerator hardware.
TexasHoldemSolverJava - A Java implemented Texas holdem and short deck Solver