Constraint Satisfaction Problems in Python
Author David Kopec discusses Constraint-Satisfaction Problems in Python. To learn more, see David's book Classic Computer Science Problems in Python | http://mng.bz/95B1
This video is also available on Manning's liveVideo platform: http://mng.bz/j2wP
Use the discount code WATCHKOPEC40 for 40% off of any Manning title.
A large number of problems that computational tools solve can be broadly categorized as constraint-satisfaction problems (CSPs). CSPs are composed of variables with possible values which fall into ranges known as domains. Constraints between the variables must be satisfied in order for constraint-satisfaction problems to be solved. Those three core concepts—variables, domains, and constraints—are simple to understand, and their generality underlies the wide applicability of constraint-satisfaction problem solving.