Explaining the Entombed Algorithm
Leon M\"achler, David Naccache

TL;DR
This paper explains the previously mysterious lookup table used in the Entombed game's maze generation algorithm and extends the method from two to three dimensions.
Contribution
It provides the first detailed explanation of the Entombed Algorithm's lookup table and generalizes it to three-dimensional maze generation.
Findings
The lookup table used in the Entombed Algorithm is fully explained.
The algorithm is successfully extended to three dimensions.
The explanation resolves a long-standing open question.
Abstract
In \cite{entombed}, John Aycock and Tara Copplestone pose an open question, namely the explanation of the mysterious lookup table used in the Entombed Game's Algorithm for two dimensional maze generation. The question attracted media attention (BBC etc) and was open until today. This paper answers this question, explains the algorithm and even extends it to three dimensions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
