Artificial Intelligence - Study Mode
[#151] What is the starting level of planning graph?
Correct Answer
(D) Level 0
[#152] The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure.
Correct Answer
(A) True
[#153] Decision trees are appropriate for the problems where ___________
Correct Answer
(D) All of the mentioned
[#154] What is meant by persistence actions?
Correct Answer
(B) Allow a literal to remain true
[#155] How many possible plans are available in partial-order solution?
Correct Answer
(D) 6