CDCL SAT Solver from Scratch in Python
-
Updated
Jun 24, 2025 - Python
CDCL SAT Solver from Scratch in Python
Generate and solve random instances of MAX-SAT and instances of MAX-SAT that are deterministically and pseudo-randomly generated from the solutions of previous MAX-SAT instances. This is a prototype of how a proof of work algorithm can be derived from a relevant problem.
💣 Minesweeper solver implemented using pysat and visualized using pygame. Also a version of Minesweeper with no guessing needed!
Python tool for converting ANF to (2-)XNF.
Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku
Slitherlink Puzzle interpreting as a SAT Problem
Using Javascript to configure the new approach to how to handle and sort large dataset known as SAT often referred to as Boolean satisfiability in a timeframe using predetermined results to speed things up.
Backtracking, watchlist-based, Boolean satisfiability problem solver
SudokuAreEz-SAT are project implement Mathematics Logic using Boolean Satisfiability to solve Sudoku puzzle.
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."