Notes on Chapter 6: Constraint Satisfaction Problems ¶ constraint satisfaction problems, or CSPs for short, are a flexible approach to searching that have proven useful in many AI-style problems CSPs ...

The graph of a pair of linear equations in two variables is represented by two lines. (i) If the lines intersect at a point, then that point gives the unique solution of the two equations.