Which of the following mentioned problems are CSP (Constraint Satisfactory Problems)?

37. Which of the following mentioned problems are CSP (Constraint Satisfactory Problems)?

  1. N queens Problem
  2. Crypt- arithmetic problem
  3. Map coloring problem
  4. Sudoku
Options:
  1. Only iv.
  2. All i., ii., iii. and iv.
  3. ii. and iv.
  4. None of the above

Answer: B) All i., ii., iii. and iv.

Explanation:

All the mentioned problems are examples of CSP (Constraint Satisfactory problem) in AI.

Comments and Discussions!

Load comments ↻






Copyright © 2024 www.includehelp.com. All rights reserved.