Minesweeper Solver: CSP Backtracking with Constraint Plotting

Traditional approaches to solving Minesweeper rely on heuristics and brute-force backtracking, which often lead to exponential blowup in complexity. Com-mon enhancements, such as cutoffs and arc consistency algorithms (e.g., AC-3), canmitigate this but at the cost of increased overhead and limited scalability. In thiswork, we present a simple yet overlooked technique that reverses the usual formu-lation: instead of assigning values to variables, we plot using constraints directly.This approach generates valid combinations rather than exhaustively checking as-signments, effectively reducing the complexity from 2^n to nCr . We term this theConstraint Plotting Technique. Our method is inherently consistent, scalable, andcapable of exploring all possible solutions without cutoffs, making it a promisingalternative for optimal Minesweeper solving