When solving constraint satisfaction problems usually some form of depth-first search is used to find a solution. Why is DFS a complete and optimal search algorithm in this setting? Mark all necessary conditions.
How fast a constraint satisfaction problem (CSP) can be solved depends on the strength of the used constraint propagation method. Which of the following statements are true?