Machine-translated by Google. Questions are authored in English.
Top

Discussion

What does constraint satisfaction add to the framework?

  • A.Costs attached to each action taken during the search
  • B.A requirement that the solution path be as short as possible
  • C.States described by variables that must satisfy stated constraints
  • D.An opponent acting against the interests of the searcher

Answer: C

A constraint problem uses a factored representation, so the algorithm can reason about which assignments are inconsistent and prune enormous regions without enumerating them. That is precisely the advantage a factored representation buys. Opponents, costs and path length belong to other variants. Noticing that the gain comes from the representation rather than from the algorithm connects this specialisation back to the discussion of atomic and factored states.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.