A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence (AI). A typical example of a CSP is a puzzle called n-queens. The objective is to place n chess queens on a board with n x n squares so that these queens do not threaten each other (Fig. 1.1). A problem of this kind is called a constraint satisfaction problem because the objective is to find a configuration that satisfies the given conditions (constraints).
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Constraint Satisfaction Problem
- Springer Berlin Heidelberg