We introduce a game called Squares where the single player
is presented with a pattern of black and
white squares and has to reduce the pattern to white by making as few
moves as possible. We present a
method for solving the game, and show that the following problem is NP-complete.
Problem 1 (Squares-Solvability). Given a pattern X
k∈N, can X be solved in k or less
We demonstrate a reduction to this problem from Not-All-Equal-3SAT.
We also present another NP-complete problem that Squares-Solvability can
be reduced to.