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

Discussion

What is a search strategy in a constraint solver?

  • A.The limit placed on the depth of the search tree
  • B.The rule deciding which variable and value to try next
  • C.The order in which the propagators are executed
  • D.The choice between systematic and local search methods

Answer: B

The strategy combines a variable ordering and a value ordering, and most solvers let the modeller specify it because a problem specific strategy often beats any general one. Propagator scheduling is an internal matter, method choice is made earlier, and depth limits are rarely used. Exposing the search control to the modeller, who knows the problem, is what distinguishes a constraint programming system from a black box solver.

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

Post your comment

Please log in or register to post a comment.