Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI
-
Updated
Jan 26, 2019 - Python
Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI
Conversor to WPM(1,3), dimacs format
✏ SAT approach for 8-queens problem
Modeling and solving Discovery of Drug Agencies(an NP class problem) as a SAT Problem. See the problem statement for more details.
Given a relationship matrix among guests, output the seating arrangement. The program converts the relationship matrix into CNF clauses and finds a solution (SAT) using DPLL algorithm.
This project implements multiple solvers for the Gem Hunter (originally from the game Minesweeper) game and compares the performance.
Add a description, image, and links to the cnf-clauses topic page so that developers can more easily learn about it.
To associate your repository with the cnf-clauses topic, visit your repo's landing page and select "manage topics."