Sudoku Validator Using SAT Algorithms( Resolution, DP and DPLL)
Ariana Kis
Sudoku Validator Using SAT Algorithms
This Python project validates Sudoku boards by encoding Sudoku constraints as a SAT (Boolean satisfiability) problem and solving it using three different SAT algorithms: DP (Davis-Putnam), DPLL (Davis-Putnam-Logemann-Loveland), and Resolution.
Features
Encodes Sudoku rules (rows, columns, and 3x3 blocks) into CNF clauses.
Converts a given Sudoku grid into SAT clauses.
Implements three SAT solving algorithms to check board validity:
DP algorithm
DPLL algorithm
Resolution-based solver
Easily switch between solvers to compare results and performance.
Getting Started
Prerequisites
Python 3.6 or higher
No external dependencies required
Usage
Clone this repository:
Like this project
Posted Jul 2, 2025
Developed a Sudoku validator using SAT algorithms in Python.
Likes
0
Views
4
