I keep touting CPs as a language of logic. Let’s see how well that claim holds up by comparing it to a well-established language of logic, Boolean Satisfiability (or “SAT”). SAT Introduction A SAT expression is an expression containing multiple Boolean variables, e.g. x1, x2, x3, etc., where each variable can be true or false (often “0” and “1” are used in place of false and true). An expression is satisfiable if there are values for its variables which result in the expressi

I debated whether I should write anything about my CP application and came to realize that I need this article to provide context for formulas and scripts in later articles. You might see some large CPs later and think “There’s no way he did this by hand.” … and you would be right. I love studying CPs, but I’m too lazy and too impatient to do it all on paper. I wrote my own symbolic math engine to process Chromatic Polynomials for a few reasons: 1) I didn’t expect an exis