A Minesweeper Solver Using Logic Inference, CSP and Sampling

10/07/2018

∙

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.

READ FULL TEXT

A Minesweeper Solver Using Logic Inference, CSP and Sampling

Towards a Formalisation of Justification and Justifiability

PASOCS: A Parallel Approximate Solver for Probabilistic Logic Programs under the Credal Semantics

Problem solving in ID-logic with aggregates: some experiments

A Typechecker for a Set-Based Constraint Logic Programming Language

Stable Model Counting and Its Application in Probabilistic Logic Programming

A Reason Maintenace System Dealing with Vague Data

Ludii and XCSP: Playing and Solving Logic Puzzles

A Minesweeper Solver Using Logic Inference, CSP and Sampling

Related Research

Towards a Formalisation of Justification and Justifiability

PASOCS: A Parallel Approximate Solver for Probabilistic Logic Programs under the Credal Semantics

Problem solving in ID-logic with aggregates: some experiments

A Typechecker for a Set-Based Constraint Logic Programming Language

Stable Model Counting and Its Application in Probabilistic Logic Programming

A Reason Maintenace System Dealing with Vague Data

Ludii and XCSP: Playing and Solving Logic Puzzles