Craftax: A Lightning-Fast Benchmark for Open-Ended Reinforcement Learning

Michael Matthews, Michael Beukman, Benjamin Ellis, Mikayel Samvelyan, Matthew Jackson +2 more
2/12/2026

No official code found. Best implementation: MichaelTMatthews/Craftax (424 stars, MIT, last commit 2026-02-10).

Abstract

Benchmarks play a crucial role in the development and analysis of reinforcement learning (RL) algorithms. We identify that existing benchmarks used for research into open-ended learning fall into one of two categories. Either they are too slow for meaningful research to be performed without enormous computational resources, like Crafter, NetHack and Minecraft, or they are not complex enough to pose a significant challenge, like Minigrid and Procgen. To remedy this, we first present Craftax-Classic: a ground-up rewrite of Crafter in JAX that runs up to 250x faster than the Python-native original. A run of PPO using 1 billion environment interactions finishes in under an hour using only a single GPU and averages 90% of the optimal reward. To provide a more compelling challenge we present the main Craftax benchmark, a significant extension of the Crafter mechanics with elements inspired from NetHack. Solving Craftax requires deep exploration, long term planning and memory, as well as continual adaptation to novel situations as more of the world is discovered. We show that existing methods including global and episodic exploration, as well as unsupervised environment design fail to make material progress on the benchmark. We believe that Craftax can for the first time allow researchers to experiment in a complex, open-ended environment with limited computational resources.

View on arXivView PDF

Code Implementations(1)

MIT

(Crafter + NetHack) in JAX. ICML 2024 Spotlight.

42450PythonFeb 2, 20248 months agoMIT
benchmarkenvironmenticml-2024machine-learningreinforcement-learning

Similar Papers

Cite this paper

@article{matthews2026craftax,
  title  = {Craftax: A Lightning-Fast Benchmark for Open-Ended Reinforcement Learning},
  author = {Michael Matthews and Michael Beukman and Benjamin Ellis and Mikayel Samvelyan and Matthew Jackson and Samuel Coward and Jakob N. Foerster},
  year   = {2026},
  eprint = {2402.16801},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2402.16801},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.16801.svg)](https://codeofpaper.com/paper/2402.16801)

Discussion