Command-line Java SAT solver supporting DIMACS input
-
Updated
May 17, 2025 - Java
Command-line Java SAT solver supporting DIMACS input
A high-performance Java logic engine that solves N x N Sudoku puzzles by reducing game constraints to Boolean Satisfiability (SAT) instances using CNF encoding and the Sat4j library.
Algorithms project for City University Y1 IN1002.
Add a description, image, and links to the boolean-satisfiability topic page so that developers can more easily learn about it.
To associate your repository with the boolean-satisfiability topic, visit your repo's landing page and select "manage topics."