49 Minesweeper as a CSP

Variables :

• All squares to be uncovered. Domain :
• $D=\{0,1\}$, where 0 denotes not a mine and 1 denotes a mine Constraints :
• The number on a square is the sum of its neighbour’s value.
• $X_1=1$
• $X_1+X_2=1$
• $X_1+X_2+X_3+X_4=3$
• X_4=1$
• $\dots$