Talk:Entombed (Atari 2600)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Kodning (talk | contribs) at 06:18, 29 July 2021 (→‎Maze problem potentially solved: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

WikiProject iconVideo games Stub‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Video games, a collaborative effort to improve the coverage of video games on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on the project's quality scale.
LowThis article has been rated as Low-importance on the project's importance scale.
Note icon
A request for a screenshot has been made to help better illustrate the article. (VG images department)
Summary of Video games WikiProject open tasks:

BBC article and research paper

  • 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)

Chris857 (talk) 14:18, 23 September 2019 (UTC)[reply]

Maze problem potentially solved

Leon 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)[reply]