Talk:Entombed (Atari 2600)
Latest comment: 3 years ago by Kodning in topic Maze problem potentially solved
BBC article and research paper
edit- Baraniuk, Chris (23 September 2019). "The mysterious origins of an uncrackable video game". www.bbc.com.
- Copplestone, Tara; Aycock, John (5 November 2018). "Entombed: An archaeological examination of an Atari 2600 game". doi:10.22152/programming-journal.org/2019/3/4.
{{cite journal}}
: Cite journal requires|journal=
(help)
Maze problem potentially solved
editLeon Mächler and David Naccache have published an article (available on arXiv here) that claims to solve/explain Entombed's lookup table. In short, the lookup table (essentially a cellular automata) is derived by imposing rules to preserve three invariant properties about the maze.
The article seems fine enough, although I think it would be nice to get some other opinions before making an edit. Solved? Kodning (talk) 06:18, 29 July 2021 (UTC)