Boolean satisfiability problem

Boolean Satisfiability Problem (sometimes called SAT) is a problem that asks if it's possible to find a set of values (called a solution) to make all of the statements in a group of statements true. In short, a SAT problem is like a big puzzle made up of lots of pieces. We have to try and fit all of the pieces together in a way that will make all of the pieces true. It's sort of like putting a jigsaw puzzle together - we have to try different combinations of pieces until we eventually make them all fit.