Suppose there's a minesweeper board like the following:
1 1 1 A B C
Where A, B, C is an unrevealed square which could contain a mine.
This can be represented with:
A + B = 1 A + B + C = 1 B + C = 1
Which can be easily solved to show that B = 1
Now, I hope I'm in the right stackexchange for this as I'm relatively amateur with maths, but is there such thing as an algorithm that can solve these types of equation relatively quickly and simply?