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)
“Our manners have been corrupted by communication with the saints. Our hymn-books resound with a melodious cursing of God and enduring Him forever. One would say that even the prophets and redeemers had rather consoled the fears than confirmed the hopes of man. There is nowhere recorded a simple and irrepressible satisfaction with the gift of life, any memorable praise of God.”
—Henry David Thoreau (1817–1862)