10. Problems suitable for general solvers – SAT

In the tenth seminar, we introduced the SAT problem. We focused on creating fast algorithms for NP-complete problems by translating them to SAT using various encodings. The problems we showed the encoding for were 3-colorability, N Queens problem and Sudoku. We briefly explained how modern CDCL SAT solvers work.