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.
Game Theory is a mathematical framework used to study and analyse strategic decision-making in situations involving multiple actors or players. It helps businesses understand…