"The following is a small, but interesting and illustrative example of a game state that has only one logical solution, but you need to take into account the entire game state to find it:"
Is that really true? You can induce that the squares in the corners are free just by looking at their surroundings.
It's impossible to determine the corner squares are free solely from their immediate surroundings.
For instance, take the 2x2 section in the top-left of the board. Although the top-right and bottom-left squares of this section are mined, it could also be the top two, or alternatively the left two.
Therefore a more complex algorithm is required to solve this board.
Comments
"The following is a small, but interesting and illustrative example of a game state that has only one logical solution, but you need to take into account the entire game state to find it:"
Is that really true? You can induce that the squares in the corners are free just by looking at their surroundings.
It's impossible to determine the corner squares are free solely from their immediate surroundings.
For instance, take the 2x2 section in the top-left of the board. Although the top-right and bottom-left squares of this section are mined, it could also be the top two, or alternatively the left two.
Therefore a more complex algorithm is required to solve this board.
You can't do it using a 2x2 section, but you can using a 3x4 section. Still, that doesn't require looking at the entire board.