Papers › The NetHack Learning Environment

The NetHack Learning Environment

24 Jun 2020NeurIPS 2020 12arXiv:2006.13760archive 2025-07-28

Heinrich Küttler, Nantas Nardelli, Alexander H. Miller, Roberta Raileanu, Marco Selvatici, Edward Grefenstette, Tim Rocktäschel

Progress in Reinforcement Learning (RL) algorithms goes hand-in-hand with the development of challenging environments that test the limits of current methods. While existing RL environments are either sufficiently complex or based on fast simulation, they are rarely both. Here, we present the NetHack Learning Environment (NLE), a scalable, procedurally generated, stochastic, rich, and challenging environment for RL research based on the popular single-player terminal-based roguelike game, NetHack. We argue that NetHack is sufficiently complex to drive long-term research on problems such as exploration, planning, skill acquisition, and language-conditioned RL, while dramatically reducing the computational resources required to gather a large amount of experience. We compare NLE and its task suite to existing alternatives, and discuss why it is an ideal medium for testing the robustness and systematic generalization of RL agents. We demonstrate empirical success for early stages of the game using a distributed Deep RL baseline and Random Network Distillation exploration, alongside qualitative analysis of various agents trained in the environment. NLE is open source at https://github.com/facebookresearch/nle.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2006.13760")

Code

Syntology Ran 1 of 11 code samples harvested from 2 repositories linked to this paper; 10 have no recorded run. Of those that ran: 1 ran · our draft was wrong.

By repository: official repository: 3 samples from 1 repository, 1 ran; community (archive-listed): 8 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

facebookresearch/nle officialmentioned in papermentioned on GitHub report
Pieter-Cawood/Reinforcement-Learning mentioned on GitHubpytorchMIT report
Sarah-wookey/RL_NetHack_2020 mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 1 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
10unverified

Licence: 3 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

nested_map facebookresearch/nle/nle/agent/agent.py official repository ran · our draft was wrong licence not identified · pointer only · 2fa2a5c4cf69b215 · report
compute_baseline_loss facebookresearch/nle/nle/agent/agent.py official repository unverified licence not identified · pointer only · e624e7bc82f85ecd · report
compute_entropy_loss facebookresearch/nle/nle/agent/agent.py official repository unverified licence not identified · pointer only · 3fba94f2f8bc0565 · report
crop_glyphs Pieter-Cawood/Reinforcement-Learning/NLE_A2C/MyAgent2.py community (archive-listed) unverified MIT (permissive) · 5685e488bd317dd0 · report
crop_state Pieter-Cawood/Reinforcement-Learning/NLE_A2C/MyAgent2.py community (archive-listed) unverified MIT (permissive) · 6b6543f92a642e1f · report
crop_state Pieter-Cawood/Reinforcement-Learning/NLE_A2C/a2c_mod.py community (archive-listed) unverified MIT (permissive) · c89816ac8ce23ea2 · report
get_views Pieter-Cawood/Reinforcement-Learning/NLE_MBS/Model_Train_File_Policies.py community (archive-listed) unverified MIT (permissive) · 8f61913dfe74ccf7 · report
make_env Pieter-Cawood/Reinforcement-Learning/NLE_DQN/Agent.py community (archive-listed) unverified MIT (permissive) · 2f6ab6f543c54d76 · report
random_walk Pieter-Cawood/Reinforcement-Learning/NLE_MBS/Model_Train_File_Policies.py community (archive-listed) unverified MIT (permissive) · b9fc7ecce3b69c96 · report
run_episode Pieter-Cawood/Reinforcement-Learning/NLE_Method_Comparison/A2C_1/evaluation.py community (archive-listed) unverified MIT (permissive) · 38d19bc77768e47c · report
transform_observation Pieter-Cawood/Reinforcement-Learning/NLE_DQN/Agent.py community (archive-listed) unverified MIT (permissive) · 2cb4d2b63925bbc6 · report

Tasks

NetHackNetHack ScoreReinforcement Learning (RL)Systematic Generalization

Datasets

Introduced by this paper, per the archive.

NetHack Learning Environment

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
NetHack Score NetHack Learning Environment RND-mon-hum-neu-mal Average Score 780 #1 of 1 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections