About

Developed a sophisticated SAT (Boolean Satisfiability) solver from the ground up in Haskell as part of my coursework in advanced programming paradigms. The project's architecture is inspired by state-of-the-art algorithms like Conflict-Driven Clause Learning (CDCL), enabling it to efficiently navigate the solution space for NP-complete problems.

Stars

Watchers

Forks