[fsckboy]

SAT? I had to look it up, so...

Boolean satisfiability problem

https://en.wikipedia.org/wiki/Boolean_satisfiability_problem

"In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE."

[hackernewds]

Ah I thought initially that these were solving SAT questions. Easy to make mistake, or perhaps just me.

[balls187]

No, I also had no idea about this type of problem and immediately thought this article was about the placement tests administered in the US.