A Minesweeper Solver Using Logic Inference, CSP and Sampling

TL;DR

This paper presents a Minesweeper solver that combines Constraint Satisfaction Problems, logic inference, and sampling techniques to efficiently solve puzzles within a 5-second limit.

Contribution

It introduces a novel integration of CSP, logic inference, and sampling methods specifically tailored for Minesweeper solving.

Findings

Successfully solves Minesweeper puzzles within 5 seconds

Demonstrates the effectiveness of combined CSP, logic inference, and sampling approaches

Provides a practical method for real-time Minesweeper solving

Abstract

Minesweeper as a puzzle video game and is proved that it is an NPC problem. We use CSP, Logic Inference and Sampling to make a minesweeper solver and we limit us each select in 5 seconds.