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.
Genetic Algorithms are optimisation techniques inspired by the principles of evolution. By mimicking natural selection, Genetic Algorithms explore a large search space and find…