Entombed
Developer(s)Western Technologies[1]
Publisher(s)US Games
Designer(s)Tom Sloper[1][2]
Programmer(s)Steven Sidley[3]: 17 
Platform(s)Atari 2600
Release1982
Genre(s)Maze
Mode(s)Single-player, multiplayer

Entombed is an Atari 2600 game designed by Tom Sloper and programmed by Steven Sidley. It was released in 1982 by U.S. Games. It involves a player moving through a maze and avoiding enemies. The game's perplexing maze generation algorithm has attracted academic study.[3]

Gameplay

The player moves downward through a continuously vertically-scrolling maze with vertical symmetry, trying to get as far as possible while avoiding enemies that move across the screen; if the player contacts a monster, they die and the game is over. The maze will continually scroll upwards on the screen, and while the player can move in any direction, this scrolling action may leave the player stuck in a dead-end; if the player's position scrolls off-screen, then the game is also over. The player can collect a "make-break" item, represented by a large dot, that can remove a wall space and allow the player to proceed out of a dead-end.[4] In two-player mode, both players are in the maze at once.

Legacy

A representation of the maze generation scheme for two rows of a typical maze from Entombed.[3] The algorithm uses five neighboring squares (bold outline) that are either open (white) or a wall (grey) to generate the state of the next square (bold 0 or 1) in a semi-random manner.

The mechanics of how Entombed generated its mazes have been the subject of academic research and some legend, as the maze data itself, if stored directly, was too large to fit within the hardware limitations of the console, even with the left/right symmetry of the mazes. Researchers evaluated the game's ROM and discovered that the mazes were generated on-the-fly by the game using the state of five adjacent squares of the maze (wall or open) already generated to determine the next part of the maze through a lookup table, including potentially a random state. Sometimes the table generates mazes that would be unsolvable without the "make-break" item. The researchers spoke to Sidley, who said the algorithm came from another unnamed programmer, but Sidley himself could not decipher why it worked. Sidley said to the researchers of this programmer, "He told me it came upon him when he was drunk and whacked out of his brain."[5][3] Later research, however, suggests that although the original programmer and his mathematical collaborator did devise the algorithm at a bar, they may have suggested or encouraged the drunken blackout story merely to avoid having to explain or assign intellectual property rights for the algorithm.[6] A 2021 paper described the algorithm for generating this lookup table and a generalization to three-dimensional mazes.[7] A 2022 publication co-authored by Paul Allen Newell, a first-hand participant in the game development, has come closer to settling the debate about the mysteries of the maze algorithm.[8]

See also

References

  1. 1 2 Stilphen, Scott. "DP Interviews Paul Allen Newell". Digital Press.
  2. ↑ Hague, James. "The Giant List of Classic Game Programmers".
  3. 1 2 3 4 Aycock, John; Copplestone, Tara (November 7, 2018). "Entombed: An archaeological examination of an Atari 2600 game". The Art, Science, and Engineering of Programming. 3 (2). arXiv:1811.02035. Bibcode:2018arXiv181102035A. doi:10.22152/programming-journal.org/2019/3/4. S2CID 53223419.
  4. ↑ "Entombed Manual" (PDF). U.S. Games. 1982.
  5. ↑ Baraniuk, Chris (September 23, 2019). "The Mysterious Origins of an Uncrackable Video Game". BBC. Retrieved September 24, 2019.
  6. ↑ Parker, Simon; Barron, Alex (January 22, 2021). Unearthing Entombed. The New Yorker Radio Hour.
  7. ↑ Mächler, Leon; Naccache, David (2021-04-21). "Explaining the Entombed Algorithm". arXiv:2104.09982 [cs.CG].
  8. ↑ Newell, Paul Allen; Aycock, John; Biittner, Katie (2022). "Still Entombed After All These Years: The continuing twists and turns of a maze game". Internet Archaeology (59). doi:10.11141/ia.59.3.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.