Minesweeper probability I ran into the situation pictured in the minesweeper game below. Note that the picture is only a small section of the entire board.
Note: The bottom right $1$ is the bottom right corner tile of the board and all other tiles have been marked/deemed safe.

What we know:


*

*There are exactly $2$ bombs left on the board

*Bombs can't be: (A & B) || (A & C) || (B & D) || (C & D)

*Bombs can be: (A & D) || (B & C) 


Can anyone prove if there is a square that is more likely to be safe/unsafe or is every square equally likely to be safe/unsafe?

You know 


*

*exactly one of A and C is a bomb 

*exactly one of B and D is a bomb 

*exactly one of A and B is a bomb


So, as you say, there are two possibilities 


*

*A and D are bombs while B and C are not

*B and C are bombs while A and D are not


As far as I can tell, these have the same likelihood  
