Minesweeper would have been a lot more popular with the above...

Reminds me of another game involving of stripping waifus while dodging monsters... Which I forgot the title is

Sorry for the late response, but I just saw this and felt the need to try to solve it. Let me know (politely, please) if I got something wrong.

If a 1 has only a single uncleared space total on its sides and corners, that space must be a mine. If three 1s are lined up adjacent to each other in a row or column (not diagonally), the three adjacent blocks on one side of the row/column are NOT mines, and the corners of the 1s on the "outside" of the adjacent row/column are confirmed NOT mines, a single mine MUST be adjacent to the middle one and the spaces to either side of that must be clear. If you can confirm with certainty that specific spaces next to a number greater than 1 are mines, subtract that number of known mines from the number in the space to predict which nearby spaces must be clear. (For clarity, when I say "clear" here, I mean only that a space does not contain a mine; in a few spaces I can confirm a number for an unchecked space, but I cannot confirm actual unchecked "clear" spaces not bordered by any mines at all.)

If we number the columns as C1-C12 from left to right, and the rows as R1-R16 from top to bottom, I can break this down into about 5 sections:

1 (Left Top): {C3, R5} and {C4, R3} (and after the former, {C2, R5}) MUST be mines, which means that {C1, R5}, {C3, R3}, and {C3, R4} CANNOT be mines. Of {C2, R1} and {C2, R2} one MUST be a mine and the other CANNOT (which is which cannot be certain), so {C2, R3} MUST be a mine for the sake of the 3.

2 (Left Middle): {C1, R10}, {C2, R10}, {C2, R11}, and {C3, R9} MUST be mines, so {C1, R11} MUST be a 3.

3 (Left Bottom): {C4, R15} and {C4, R16} MUST be mines. Of {C1, R16}, {C2, R16}, and {C3, R16}: ONLY ONE of the three can (and MUST) be a mine, so the mine MUST be {C2, R16}, {C1, R16} MUST be a 1, and {C3, R16} MUST be a 3.

4 (Center to Middle Top): {C6, R8} and {C7, R9} MUST be mines, so {C7, R8}, {C8, R6}, {C8, R7}, {C8, R8}, and {C9, R8} CANNOT be mines ({C7, R8} MUST be a 2). The vertical alternating 1s and 2s on {C7, Rs 1-5} mean that the 2s' mines must be NONADJACENT to each other for the sake of the 1s, so {C8, R1}, {C8, R3}, and {C8, R5} MUST be mines and {C8, R2} and {C8, R4} CANNOT be mines. {C10, R8} MUST be a mine.

5 (Right Bottom): {C10, R12}, {C10, R13}, and {C10, R14} MUST be mines, so {C11, R14} CANNOT be a mine. Of {C12, R15} and {C12, R16} one MUST be a mine and the other CANNOT (which is which cannot be certain), so {C12, R14} also CANNOT be a mine. Of the 5 vertical spaces between and including {C11, R8} and {C11, R12}, the space which contains the single mine for {C10, R10} (which cannot be certain) determines which other space holds another mine for the 2s:
- A: If {C11, R9} IS a mine, then {C11, R8}, {C11, R10}, and {C11, R11} CANNOT be mines and {C11, R12} MUST be a mine.
- B: If {C11, R10} IS a mine, then NONE of {C11, R8}, {C11, R9}, {C11, R11}, and {C11, R12} can be mines.
- C: If {C11, R11} IS a mine, then {C11, R9}, {C11, R10}, and {C11, R12} CANNOT be mines and {C11, R8} MUST be a mine.

Therefore, {C1, R10}, {C2, R3}, {C2, R5}, {C2, R10}, {C2, R11}, {C2, R16}, {C3, R5}, {C3, R9}, {C4, R3}, {C4, R15}, {C4, R16}, {C6, R8}, {C7, R9}, {C8, R1}, {C8, R3}, {C8, R5}, {C10, R8}, {C10, R12}, {C10, R13}, and {C10, R14} MUST be mines.

By extension, {C1, R5}, {C1, R11}, {C1, R16}, {C3, R3}, {C3, R4}, {C3, R16}, {C7, R8}, {C8, R2}, {C8, R4}, {C8, R6}, {C8, R7}, {C8, R8}, {C9, R8}, {C11, R14}, and {C12, R14} CANNOT be mines.

Of known uncertainties, only ONE of {C2, R1} and {C2, R2} MUST be a mine and the other CANNOT be a mine. Of the set of {C11, R8}, {C11, R9}, {C11, R10}, {C11, R11}, and {C11, R12}, the ONLY possible groupings of mines are {C11, R8} and {C11, R11}, {C11, R9} and {C11, R12}, or only {C11, R10}. Only ONE of {C12, R15} and {C12, R16} MUST be a mine and the other CANNOT be a mine.

Who else tried to figure out the Minesweeper game?