Constraint Satisfaction, Heuristic Technique, Searching Technique, Searching Algorithm, Intelligence.
must be defined for each problem. For example, in cryptarithmetic problems, enough means that each letter has been assigned a unique numeric value. Constraint Satisfaction problems in AI have goal of discovering some problem state that satisfies a given set of constraints. Design tasks can be