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.

CDCL SAT Solver from Scratch in Python

Python tool for converting ANF to (2-)XNF.

Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku

💣 Minesweeper solver implemented using pysat and visualized using pygame. Also a version of Minesweeper with no guessing needed!

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.

Slitherlink Puzzle interpreting as a SAT Problem

Backtracking, watchlist-based, Boolean satisfiability problem solver

SudokuAreEz-SAT are project implement Mathematics Logic using Boolean Satisfiability to solve Sudoku puzzle.