When is DFS optimal
What is the space complexity of depth-first search when you detect repeated states?
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?
Which of the following statements are true about admissible heuristics?
Which of the following statements are true about consistent heuristics?
Mark all that apply!
Minimax is not guaranteed to be optimal if ...
Minimax with Alpha-Beta pruning ...
Supervised learning differs from unsupervised learning in that supervised learning requires ...
Regression differs from classification in that ...
Last changed2 years ago
