This repository contains a 3-CNF SAT solver that uses a genetic algorithm to find solutions to Boolean satisfiability problems. The code for the solver and accompanying documentation can be found in this repository.
This report aims to inspect the effects of the ratio m/n on a 3-CNF formula’s satisfiability, where m is the number of clauses, and n is the number of variables. This is done by explaining the code used to produce the results, presenting the resulting data, and explaining the results in the conclusion.
To associate your repository with the 3cnf topic, visit your repo's landing page and select "manage topics."