A search program that uses SAT solvers to find patterns in Higher Range Outer Totalistic (HROT) rules
-
Updated
Nov 8, 2023 - Python
A search program that uses SAT solvers to find patterns in Higher Range Outer Totalistic (HROT) rules
Python tool for converting ANF to (2-)XNF.
Projects on symbolic systems, covering logic and problem solving (June 2020).
Solving the Yashi game using a combination of graph theory and SAT-solving. First, connectivity of the graph is verified, and if true, identification of all possible cycles is done. Then, after generating all necessary constraints, they are passed to a SAT solver.
Approximation and randomized algorithms - Assignment 01 - SAT
Solution for total coloring problem using CSP & SAT
Add a description, image, and links to the sat-solving topic page so that developers can more easily learn about it.
To associate your repository with the sat-solving topic, visit your repo's landing page and select "manage topics."