Skip to content
#

sat

Here are 436 public repositories matching this topic...

The CNF-SAT problem is: Given a logical expression in Conjunctive Normal Form, is there a truth assignment for the variables which causes the CNF expression to be true? Answer is yes, if there is an assignment that makes all the clauses evaluate to T (true). Use a depth first search algorithm for solving the problem. After you assign values to a…

  • Updated Feb 12, 2017
  • C

Sudoku Solver by constraint satisfaction problem (CSP) using heuristics - Minimum Remaining Value (MRV), Least Common Value (LCV), Maintainin Arc Consistency (MAC). Secondly, by converting to Satisfiability Problem (SAT) and using a sat solver (miniSAT).

  • Updated May 11, 2017
  • Java

Improve this page

Add a description, image, and links to the sat topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the sat topic, visit your repo's landing page and select "manage topics."

Learn more