Constraint Satisfaction
In a general constraint satisfaction problem, every variable can take a value in a domain. A backtracking algorithm therefore iteratively chooses a variable and tests each of its possible values; for each value the algorithm is recursively run. Look ahead is used to check the effects of choosing a given variable to evaluate or to decide the order of values to give to it.
Read more about this topic: Look-ahead (backtracking)
Famous quotes containing the words constraint and/or satisfaction:
“In America a woman loses her independence for ever in the bonds of matrimony. While there is less constraint on girls there than anywhere else, a wife submits to stricter obligations. For the former, her fathers house is a home of freedom and pleasure; for the latter, her husbands is almost a cloister.”
—Alexis de Tocqueville (18051859)
“Let us put an end to self-inflicted wounds. Let us remember that our national unity is a most priceless asset. Let us deny our adversaries the satisfaction of using Vietnam to pit Americans against Americans.”
—Gerald R. Ford (b. 1913)