Learn how SAT solvers work by watching them solve Sudoku — a curses TUI animating DPLL, CDCL, and WalkSAT step by step
-
Updated
Jun 30, 2026 - Python
#
walksat
Here are 2 public repositories matching this topic...
Hybrid heuristic and exact solvers for 0-1 Knapsack (GA+B&B, 90%), 3-SAT (WalkSAT+GSAT, 100%), and TSP (GA+2-opt/3-opt, 76% exact). Research-grade benchmarking on Pisinger, SATLIB UF250, and TSPLIB.
genetic-algorithm np-hard operations-research knapsack-problem branch-and-bound metaheuristics combinatorial-optimization 3-sat traveling-salesman-problem walksat
-
Updated
May 22, 2026 - Jupyter Notebook
Improve this page
Add a description, image, and links to the walksat topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the walksat topic, visit your repo's landing page and select "manage topics."