Jump to content

Constraint satisfaction problem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 159.121.103.105 (talk) at 22:07, 16 April 2003 (First draft. More to come.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Constraint satisfaction problems or CSPs are mathematical problems where one must find states or objects in a system that satisfy a number of constraints or criteria. CSPs are the subject of intense research in both artificial intelligence and operations research. Many CSPs require a combination of heuristics and combinatorial search methods to solve in a reasonable time.

One very good text on the subject is Edward Tsang's Foundations of Constraint Satisfaction.


EXAMPLES

Eight queens puzzle

Retrieved from "https://en.wikipedia.org/w/index.php?title=Constraint_satisfaction_problem&oldid=837076"