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} }
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
Figures from this paper
Figures
8 Citations
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
- Computer Science, Mathematics
- MFCS
- 2001
- 200
- PDF
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
- Mathematics, Computer Science
- Graphs Comb.
- 2007
- 200
- Highly Influenced
- PDF
References
SHOWING 1-5 OF 5 REFERENCES
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science, Mathematics
- 1978
- 47,337
- PDF