Constraint satisfaction problems on finite domains are typically solved using a form of ___________
(a) Search Algorithms
(b) Heuristic Search Algorithms
(c) Greedy Search Algorithms
(d) All of the mentioned
This question was posed to me during an interview.
My doubt is from Constraints Satisfaction Problems topic in chapter Problem Solving of Artificial Intelligence
Select the correct answer from above options
Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience
