# Non-unique Minesweeper Solution?

I appear to have encountered a position in which it is impossible to logically determine whether or not a square is a mine. From the research I have done, it appears that
a) A unique solution and
b) A method to determine this solution without any guesses
are central rules of this game.

Here is a screenshot of the final position: The bottom right 4 squares require a pattern of two squares with mines, and two without, forming the diagonals of the square. Basic logic shows that that is the only way to solve it. In the top section of the square, exactly 1 mine must be filled, so that rule of the square with a three is not broken. If you fill two, then the rule of the 3 square is broken. Likewise, at least one of the bottom must be filled, in order to fill the required amount of mines. The two mines cannot be adjacent to each other for the following reason:

Case 1) They are both in the left column of the square.
Then, the rule of the 2 square is broken (too many mines)

Case 2) They are both in the right column of the square.
The rule of the 2 square is again broken (too little mines)

The question is whether or not I am correct in saying that this is a non-unique solution.