Which of the following statements is/are true for the Constraint satisfaction problem?
A) The tree-structured Constraint satisfaction problem can not be solved in polynomial time.
B) Forward checking is the same as Arc consistency.
C) Computation time depends on a number of constraints and variable.
D) Iterative min-conflicts algorithms can solve 10000-Queens.
1
C and B only
2
A and D only
3
A and C only
4
C and D only