This project was part of the course "Knowledge Representation" for the Msc Artificial intelligence in VU Amsterdam
It contains a SAT solver with the algorithm DPLL implemented and three different heuristic options. Jeroslow-Wang heuristic, Minimum Remaining Values and Random.
Run the SAT solver with the command SAT -Sn inputfile , for example: SAT -S2 sudoku_nr_10 {S calls for the heuristic n=1 for the Random DP, n=2 for JW and 3 for MRV.