Work

Solving atomix exactly

Year: 2015
Type: dissertation
Abstract: This work proposes an algorithm based on heuristic search to solve Atomix. Atomix is a video game puzzle developed in the 1990s. It falls under the category of sliding block puzzles, which also contains popular games such as Sokoban, Rush Hour, and the (n2 􀀀1)-puzzle, which have all been well studied in the literature. The Atomix puzzle takes place on an integer rectangular grid, where pieces (called atoms) can be moved by the player through sliding operations. A sliding operation consists of moving a single atom horizontally or vertically on the grid; once a move is made, the atom will slide over the grid until it reaches an obstacle, which could be another atom or a ‘wall’ (a static obstacle). The objective of the game is to arrange the atom in a certain configuration called a molecule. Since the place of the molecule is not specified there are often multiple possible goal states. Atomix’s complexity was first studied by Holzer and Schwoon (2004), who have proved it to be PSPACE-complete. Heuristic search methods for Atomix were studied by Hüffner et al. (2001); however, the heuristic proposed by the article is somewhat uninformed, leaving several instances of the standard testbed unsolved. In this work, we study domain-dependent heuristic functions for Atomix based on pattern databases (CULBERSON; SCHAEFFER, 1996), in the hopes of advancing the contributions made by (HÜFFNER et al., 2001). We also study a number of tie-breaking rules for the A* algorithm, as well as some implementation-specific optimizations. Finally, an improved solution is proposed.
Language: English
Open Access status: green
OpenAlex ID: W2568308528
Cites: 23
Cited by:
Related to: 10