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

Discussion

What is no-good learning?

  • A.Recording assignments proved inconsistent so they are never retried
  • B.Learning which of the variable orderings performs best over many runs
  • C.Discarding values that appear in no solution to the problem
  • D.Recording the values that led to a solution for later reuse

Answer: A

When a partial assignment is shown to fail, storing it as a no-good prevents the search from reconstructing the same doomed combination by a different route. It is the same idea as clause learning in satisfiability solvers and it can transform performance. Ordering statistics, value pruning and solution caching are different techniques. Converting a failure into a permanent constraint is how a search learns from its own mistakes within a single run.

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

Post your comment

Please log in or register to post a comment.