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
Answer:D
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
Explanation: Any Search techniques can be used