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)
“Besides, our action on each other, good as well as evil, is so incidental and at random, that we can seldom hear the acknowledgments of any person who would thank us for a benefit, without some shame and humiliation. We can rarely strike a direct stroke, but must be content with an oblique one; we seldom have the satisfaction of yielding a direct benefit, which is directly received.”
—Ralph Waldo Emerson (1803–1882)