Minesweeper Chess
Each number in the diagrams below represents the number of pawns which can be
attacked from a queen placed in that square.
|
1. Place the minimum number of
pawns. |
|
|
1 |
|
|
|
|
|
|
|
|
|
|
2 |
|
|
|
|
|
|
|
|
|
|
|
4 |
|
|
|
|
|
|
|
|
|
|
3 |
|
|
|
|
|
|
|
|
|
|
|
|
2. Place the maximum number of
pawns. |
|
|
1 |
|
|
|
|
|
|
|
|
|
|
3 |
|
|
|
|
|
|
|
|
|
|
|
4 |
|
|
|
|
|
|
|
|
|
|
2 |
|
|
|
|
|
|
|
|
|
|
|
Source: Original.
Solutions were received from Dan Chirica, Alan O'Donnell, Kirk Bresniker,
Philippe Fondanaiche, Leendert Biemans, Ryan Elmore, Joseph DeVincentis, and
David Bachtel. The solutions are below. There is only one
solution for each problem.
|
1. Place the minimum number of
pawns. 4 can be placed. |
|
|
1 |
|
P |
|
|
|
|
|
|
|
|
2 |
|
|
|
P |
|
|
|
|
|
|
|
4 |
|
P |
|
|
|
|
|
P |
|
|
3 |
|
|
|
|
|
|
|
|
|
|
|
|
2. Place the maximum number of
pawns. 10 can be placed. |
|
|
1 |
|
|
|
|
|
|
|
P |
|
P |
3 |
|
|
|
P |
|
P |
|
P |
|
|
|
4 |
P |
|
P |
|
|
|
|
P |
P |
P |
2 |
|
|
|
Mail to Ken