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 father’s house is a home of freedom and pleasure; for the latter, her husband’s is almost a cloister.”
—Alexis de Tocqueville (1805–1859)
“It is remarkable with what pure satisfaction the traveler in these woods will reach his camping-ground on the eve of a tempestuous night like this, as if he had got to his inn, and, rolling himself in his blanket, stretch himself on his six-feet-by-two bed of dripping fir twigs, with a thin sheet of cotton for roof, snug as a meadow-mouse in its nest.”
—Henry David Thoreau (1817–1862)