Solve N-Queen problem with csp programming of Microsoft Solver Foundation
My first article/tip on code project.
CSP Programming of Microsoft Solver Foundation
Abstract
A lot of problems in Artificial Intelligence are classified as Constraint Satisfaction Problem or CSP. These problems are combinatorial complexity, resource allocation, planning, etc.
A Constraint Satisfaction Problem (CSP) consists of:
- set of variables, X1, X2, …, Xn,
- for each variable Xi a respective domain Di.
- set of constraints, C1, C2, …, Cm, restricting the values that the variables can simultaneously take