xkcd

[The Glyphstone]

Spoiler: It's solvable, even not knowing the blank mineless squares or the number of mines.

Show

2_1_
__3_
3___
_1_1

Only one of the two squares in the bottom left is a mine, so we know where 2 mines are, and two squares that are not mines:

2_1_
**3_
3?x_
?1x1

There has to be a mine next to the bottom 1, and no other mines next to the top one, which leaves only one place left a mine could go next to the 3:

2x1x
**3x
3*x*
x1x1

Yeah, it took me a minute to recover my long-dormant Minesweeper logic skills and solve it that way.