<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Entombed: An archaeological examination of an Atari 2600 game · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1811.02035/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1811.02035/feed.xml" rel="self" type="application/rss+xml" /><item><title>Entombed: An archaeological examination of an Atari 2600 game — mentioned by floatingatoll</title><link>https://news.ycombinator.com/item?id=21551490</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.02035:21551490</guid><pubDate>Sat, 16 Nov 2019 07:25:41 GMT</pubDate><description>&lt;p&gt;Related on HN: https://news.ycombinator.com/item?id=18412547 &amp;gt; Entombed: An archaeological examination of an Atari 2600 game One type of archaeogaming research is digital excavation, a technical examination of the code and techniques used in old games&amp;#x27; implementation. We apply that in a case study of Entombed, an Atari 2600 game released in 1982 by US Games. The player in this game is, appropriately, an archaeologist who must make their way through a zombie-infested maze. Maze generation is a fruitful area for comparative retrogame archaeology, because a number of early games on different…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.02035/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Entombed: An archaeological examination of an Atari 2600 game — mentioned by nneonneo</title><link>https://news.ycombinator.com/item?id=21066186</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.02035:21066186</guid><pubDate>Wed, 25 Sep 2019 00:14:31 GMT</pubDate><description>&lt;p&gt;Nice article - but the BBC did get a major detail wrong. The mazes are not always solvable - Figure 5 in the paper (https://arxiv.org/abs/1811.02035) explicitly demonstrates an unsolvable maze sample from the game, which can only be solved by collecting and using a &amp;quot;make-break&amp;quot; powerup (which allows the user to create or remove a wall). They interviewed a co-creator who claimed it did always make solvable mazes, which is probably where the BBC journalist got confused.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.02035/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Entombed: An archaeological examination of an Atari 2600 game — mentioned by throwaway66920</title><link>https://news.ycombinator.com/item?id=21047954</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.02035:21047954</guid><pubDate>Mon, 23 Sep 2019 11:48:06 GMT</pubDate><description>&lt;p&gt;A paper that actually talks about the algorithm and a quote that sums it up https://arxiv.org/pdf/1811.02035.pdf &amp;gt; The basic maze generating routine had been partially written by a stoner who had left. I contacted him to try and understand what the maze generating algorithm did. He told me it came upon him when he was drunk and whacked out of his brain, he coded it up in assembly overnight before he passed out, but now could not for the life of him remember how the algorithm worked.’&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.02035/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item><item><title>Entombed: An archaeological examination of an Atari 2600 game — HN submission</title><link>https://news.ycombinator.com/item?id=18412547</link><guid isPermaLink="false">urn:hackerpapers:submission:1811.02035:18412547</guid><pubDate>Fri, 09 Nov 2018 05:40:05 GMT</pubDate><description>&lt;p&gt;Entombed: An archaeological examination of an Atari 2600 game&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;42 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1811.02035/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item></channel></rss>
