The computer game "The Witness" contains various puzzles based on a finite square grid graph arranged in the usual way. A path must be found from a given point on the edge to another. Each square can contain a symbol that describes additional constraints.
For simplicity and to get speedily to the maths I will describe a reasonably similar but simplified version of the game. This version contains "separating" puzzles where only empty squares and tiles containing coloured "dot" symbols are used. And "pairing" puzzles where only empty squares and the mono-coloured "star" symbol is used.
Both types of puzzle involve making envelopes between the path and the edge of the grid to enclose groups of symbols. Dots must be in seprate regions (envelopes) to dots of other colours, whereas stars must be in pairs.
In separating puzzles the existence of any group of 3 adjacent squares in a puzzle that form the shape of the L shaped tromino with entirely dissimilar colours of dot symbols are unsolvable.
The same is true of a two colour 2x2 square of dot symbols with diagonally opposite same colours.
The same sort of check also exists for the pairing puzzle except that the shape is that of 5 square pentomino that is in a "+" shape.
Q: Can the shapes above that indicate a puzzle is unsolvable be reduced in size, or the check otherwise be made simpler?