Minesweeper Proof #1 [matthew]
Given:
To Prove:
1. Ignore the lower "1" from the given situation. Highlight the possible location of the "2"'s bombs in yellow, and the possible location of the upper "1" bomb in red with the overlapping spaces in orange.
2. Only one of the "?" can be a bomb. Assume the lower "?" is the bomb.
3. Following through on the logic of this assumption, all other boxes touching both "1" squares can be crossed off.
However, these actions result in a situation in which both "1" squares have fulfilled their quotas, but the 2 square is missing a second bomb. Therefore, this situation is null.
4. Therefore, the upper "?" must be the correct bomb.
5. All other spaces touching the upper "1" can be clicked on. This leaves the "2" with only one other possible square, which must be the other bomb.
6. By clicking on the remaining boxes touching the lower "1", the proof is complete.
Questions?
(Note: Green spaces represent variable "open" spaces.)
To Prove:
1. Ignore the lower "1" from the given situation. Highlight the possible location of the "2"'s bombs in yellow, and the possible location of the upper "1" bomb in red with the overlapping spaces in orange.
2. Only one of the "?" can be a bomb. Assume the lower "?" is the bomb.
3. Following through on the logic of this assumption, all other boxes touching both "1" squares can be crossed off.
However, these actions result in a situation in which both "1" squares have fulfilled their quotas, but the 2 square is missing a second bomb. Therefore, this situation is null.
4. Therefore, the upper "?" must be the correct bomb.
5. All other spaces touching the upper "1" can be clicked on. This leaves the "2" with only one other possible square, which must be the other bomb.
6. By clicking on the remaining boxes touching the lower "1", the proof is complete.
Questions?
