ó ¯"Oc@s'dZddlTddd„ƒYZdS(sICSP (Constraint Satisfaction Problems) problems and solvers. (Chapter 6).iÿÿÿÿ(t*tCSPcBsheZdZd„Zd„Zd„Zd„Zd„Zd„Zd„Z d„Z d „Z d „Z RS( sHThis class describes finite-domain Constraint Satisfaction Problems. A CSP is specified by the following inputs: vars A list of variables; each is atomic (e.g. int or string). domains A dict of {var:[possible_value, ...]} entries. neighbors A dict of {var:[var,...]} that for each variable lists the other variables that participate in constraints. assignment A dict of {var:val} entries The class supports data structures and methods that help you solve CSPs by calling a search function on the CSP. c Cs&t|d|d|d|d|ƒdS(sConstruct a CSP problem.tvarstdomainst neighborst has_conflictN(tupdate(tselfRRRR((s C:\Users\Íéêüëáò\Desktop\×åéìåñéíü 2011-12\Ôå÷íçôÞ Íïçìïóýíç\áóêÞóåéò\Üóêçóç2\áóê2_üëá ôá ðñü÷åéñá áñ÷åßá ìáæåìÝíá\ðñïãñáììáôéóôéêÜ ðñïâëÞìáôá\Problem2_2\csp.pyt__init__scCs|||s