Constraint Satisfaction Problems are mathematical problems where a set of variables must satisfy a given set of constraints. CSPs are used in AI for tasks such as scheduling, resource allocation, and puzzle-solving. Techniques like Backtracking and Constraint Propagation are used to find feasible solutions.
Unsupervised Learning is a Machine Learning technique where models learn patterns and structures within data without labelled examples. By uncovering hidden relationships and clustering…