Corpus ID: 5271497

The Complexity of Clickomania

@article{Biedl2001TheCO,
  title={The Complexity of Clickomania},
  author={T. Biedl and E. Demaine and Martin L. Demaine and Rudolf Fleischer and L. Jacobsen and J. Munro},
  journal={ArXiv},
  year={2001},
  volume={cs.CC/0107031}
}
  • T. Biedl, E. Demaine, +3 authors J. Munro
  • Published 2001
  • Mathematics, Computer Science
  • ArXiv
  • 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… CONTINUE READING
    Self-assembling RNA square
    89
    Effects of Processing on the Chemical and Anti-nutritional Properties of Cassava Roots.
    5
    Small Mutations in Bordetella pertussis Are Associated with Selective Sweeps
    69
    Modeling of Spherical Particle Packing Structures Using Mathematical Tessellation
    2

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Representing Local Structure Using Tensors
    312
    Email on math-fun mailing list
    • 2000
    Introduction to the Theory of Computation
    2288
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    39846
    Complexity Results for Multiprocessor Scheduling under Resource Constraints
    387
    DK-5230 Odense M Denmark eljay@imada.sdu.dk
      Massachusetts 02139 United States edemaine@mit.edu Martin L. Demaine MIT Laboratory for Computer Science 200 Technology Square Cambridge, Massachusetts 02139 United States mdemaine@mit
        can we construct an LR(k) grammar?