Atomix (video game)

From Wikipedia, the free encyclopedia

Atomix
Image:Atomix Coverart.png
Developer(s) Softtouch
Publisher(s) Thalion Software
Platform(s) MS-DOS, Amiga, Commodore 64, Atari ST
Release date 1990
Genre(s) Tile-based transport puzzle
Mode(s) Single player, 2 player
Media Floppy disk (1)
Input methods Keyboard

Atomix is a 1990 2D transport puzzle video game created by Softtouch (Guenter Kraemer) and published by Thalion Software.

The object of the game is to assemble molecules from compound atoms by sliding the atoms around. This has to be done in a set time limit for each level. There screen contains a small preview window showing what each molecule should look like. The tile-based playing field contains a number of atom blocks, as well as walls. The player can move an atom around by selecting it, and moving it up, down, left, or right. The catch is that, when moving, an atom block will not stop moving until it hits a wall or another atom block. Even if it is the last atom to complete the molecule, it will keep moving past the almost complete molecule. Since it is not possible to stop anything in mid-movement, it requires careful planning to align all blocks properly. Of course, each level has a strict time limit.

[edit] Levels

The first level is water (H2O) with three atoms in a horizontal layout. The second is methane (CH4) in a cross-shape. Further levels use increasingly large and complex molecules, many with diagonal links which are harder to make. If the player runs out of time (except on a bonus level), the game ends, unless the player buys an extra credit from his score (which is rather expensive). The game has 30 levels, the first nine of which are listed below.

About every five levels there is a bonus level, which is filled of Erlenmeyer flasks rather than atoms. The flasks are filled with different amounts of liquid, and have to be put in a set pattern. The gameplay is basically identical to regular levels.

[edit] Computational complexity

When generalized to puzzles of arbitrary sizes, the problem of determining whether an Atomix puzzle has a solution is PSPACE-complete.[1] Some heuristic approaches have been considered.[2]

[edit] References

  1. ^ Markus Holzer and Stefan Schwoon (2004), “Assembling molecules in ATOMIX is hard”, Theoretical Computer Science 313 (3): 447-462, <http://dx.doi.org/10.1016/j.tcs.2002.11.002> 
  2. ^ Falk Hüffner, Stefan Edelkamp, Henning Fernau, and Rolf Niedermeier (2001). "Finding Optimal Solutions to Atomix", KI 2001: Advances in Artificial Intelligence : Joint German/Austrian Conference on AI, Vienna, Austria, September 19–21, 2001, Lecture Notes in Computer Science 2174/2001. Springer, 229. ISSN 03029743. 
Languages