What is meant by consistent in state-space search?
a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state
d) None of the mentioned
Explanation: Consistent means that the completed actions will not undo any desired literals.
What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?
a) Success
b) Error
c) Compilation
d) Termination
Which approach is to pretend that a pure divide and conquer algorithm will work?
a) Goal independence
b) Subgoal independence
c) Both Goal & Subgoal independence
d) None of these
Explanation: Subgoal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.
Alpha Beta Pruning:
Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can’t influence the final decision.
Which values are independant in minimax search algorithm?
a) Pruned leaves x and y
b) Every states are dependant
c) Root is independant
d) None of these
Explanation: The minimax decision are independant of the values of the pruned values x and y because of the root values.
