**Reference**:- Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, and J. Ian Munro, “The Complexity of Clickomania”, in
*More Games of No Chance*, edited by R. J. Nowakowski, 2002, pages 389–404, Cambridge University Press. Collection of papers from the MSRI Combinatorial Game Theory Research Workshop, Berkeley, California, July 24–28, 2000. **Abstract**:- We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player repeatedly removes a chosen connected monochromatic group of at least two square blocks, and any blocks above it fall down. We show that one-column puzzles can be solved, i.e., the maximum possible number of blocks can be removed, in linear time for two colors, and in polynomial time for an arbitrary number of colors. On the other hand, deciding whether a puzzle is solvable (all blocks can be removed) is NP-complete for two columns and five colors, or five columns and three colors.
**Comments**:- This paper is also available as arXiv:cs.CC/0107031 of the Computing Research Repository (CoRR).
The paper is also available from the book's website as http://www.msri.org/publications/books/Book42/files/biedl.ps.gz.

**Length**:- The paper is 15 pages.
**Availability**:- The paper is available in PostScript (295k) and gzipped PostScript (108k).
- See information on file formats.
- [Google Scholar search]

See also other papers by Erik Demaine.

Last updated July 28, 2016 by Erik Demaine.