Let $$n \geq 2$$ be an integer. An $$n \times n$$ board is initially empty. Each minute, you may perform one of three moves:
For which $$n$$ is it possible that, after some nonzero number of moves, the board has no stones?