Corpus ID: 6705123

On the Complexity of the “ Reflections ” game David Kempe January 2 , 2003

@inproceedings{Kempe2003OnTC,
  title={On the Complexity of the “ Reflections ” game David Kempe January 2 , 2003},
  author={D. Kempe},
  year={2003}
}
  • D. Kempe
  • Published 2003
  • The game “Reflections” is a puzzle game that has been around and entertaining users in various versions for many years. A single player tries to hit a given set of light bulbs with a laser beam, by placing mirrors and other optical items on grid cells. In this document, we investigate the complexity of the game, and show that deciding whether a given level has a solution is NP-complete. This is strong evidence that we are unlikely to come up with a simple way to solve levels of the game… CONTINUE READING
    8 Citations

    Figures from this paper

    Games, puzzles and computation
    • 170
    • PDF
    Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
    • 200
    • PDF
    A Survey of NP-Complete Puzzles
    • 137
    • PDF
    Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
    • 200
    • Highly Influenced
    • PDF
    On the Complexity of a Derivative Chess Problem
    • B. Martin
    • Computer Science, Mathematics
    • ArXiv
    • 2007
    • 1
    • PDF
    On the Complexity of a Deriviative Chess Problem

    References

    SHOWING 1-5 OF 5 REFERENCES
    Sokoban is PSPACE-complete
    • 135
    Minesweeper is NP-complete
    • 135
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,337
    • PDF
    Efficient Planarity Testing
    • 1,127
    • Highly Influential
    • PDF
    Planar Formulae and Their Uses
    • 739