Scribd
Upload
89 views

Constraint Satisfaction Problems: Artificial Intelligence COSC-3112 Ms. Humaira Anwer

This document summarizes a lecture on constraint satisfaction problems (CSP). It defines a CSP as consisting of variables, domains, and constraints. It provides examples of CSPs like Sudoku and map coloring. It explains how to convert problems into CSP format and describes constraint graphs. Popular CSP problems mentioned include cryptarithmetic, n-queens, map coloring, crosswords and Sudoku. It outlines benefits of the CSP approach and assigns reading on job scheduling as an example CSP problem.

Uploaded by

MUHAMMAD ALI
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
89 views

Constraint Satisfaction Problems: Artificial Intelligence COSC-3112 Ms. Humaira Anwer

This document summarizes a lecture on constraint satisfaction problems (CSP). It defines a CSP as consisting of variables, domains, and constraints. It provides examples of CSPs like Sudoku and map coloring. It explains how to convert problems into CSP format and describes constraint graphs. Popular CSP problems mentioned include cryptarithmetic, n-queens, map coloring, crosswords and Sudoku. It outlines benefits of the CSP approach and assigns reading on job scheduling as an example CSP problem.

Uploaded by

MUHAMMAD ALI
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Lecture 17

CONSTRAINT
SATISFACTION PROBLEMS
Artificial Intelligence
COSC-3112

Ms. Humaira Anwer


[email protected]

Lecture 17- Constraint Satisfaction Problems 1


Today’s Agenda
• Constraint Satisfaction Problems
• Converting Problems to CSP
• CSP Example: Sudoku
• CSP Example: Map coloring
• Constraint Graph
• Popular Problems of CSP

Lecture 17- Constraint Satisfaction Problems 2


Constraint Satisfaction Problems
(CSP)
• A problem that requires its solution within some
limitations/conditions also known as constraints.
• It consists of:
• X is a set of variables, {X1, . . . ,Xn}.
• D is a set of domains, {D1, . . . ,Dn}, one for each variable.
• C is a set of constraints that specify allowable combinations of
values. (C = {C1, C2, C3,......, Cn} )

Lecture 17- Constraint Satisfaction Problems 3


Constraint Satisfaction Problems
• CSP:
• state is defined by variables Xi with values from
domain Di
• goal test is a set of constraints specifying
allowable combinations of values for subsets of
variables

• Allows useful general-purpose algorithms with


more power than standard search algorithms

Lecture 17- Constraint Satisfaction Problems 4


Converting Problems to CSP
• Step 1: Create a variable set.
• Step 2: Create a domain set.
• Step 3: Create a constraint set with variables and
domains (if possible) after considering the
constraints.
• Step 4: Find an optimal solution.

Lecture 17- Constraint Satisfaction Problems 5


CSP: Example
SUDOKO
Variables ->
Boxes

Domain ->
Range of Numbers 1-9

Constraints ->
Game Rules

Lecture 17- Constraint Satisfaction Problems 6


CSP: Example, Map Coloring Problem
• Consider a map coloring problem below:

• A map is given to you and you have to fill it with


only three colors : Blue, Green and Red. But no two
adjacent locations should have the same color.
Lecture 17- Constraint Satisfaction Problems 7
CSP: Example Map Coloring

Variables
X={WA, NT, Q, NSW, V,
SA, T }
Domains
Di = {red,green,blue}
Constraints:
adjacent regions must
have different colors
e.g., WA ≠ NT
Lecture 17- Constraint Satisfaction Problems 8
CSP: Example Map Coloring
• There are many possible solutions to this problem,
such as
• {WA=red ,NT =green,Q=red ,NSW =green, V =red
,SA=blue, T =red }.

Lecture 17- Constraint Satisfaction Problems 9


CSP: Constraint Graph
• It is helpful to visualize a CSP as a constraint graph
• The nodes of the graph correspond to variables of
the problem
• Link connects any two variables that participate in a
constraint

Lecture 17- Constraint Satisfaction Problems 10


CSP: Constraint Graph

Lecture 17- Constraint Satisfaction Problems 11


CSP: Exercise

Lecture 17- Constraint Satisfaction Problems 12


CSP: Benefits
• CSPs yield a natural representation for a wide
variety of problems
• it is often easier to solve a problem using CSP based
problem solver than to design a custom solution using
another search technique
• CSP solvers can be faster than state-space searchers
• the CSP solver can quickly eliminate large swatches of
the search space
• Many problems that are intractable for regular
state-space search can be solved quickly when
formulated as a CSP

Lecture 17- Constraint Satisfaction Problems 13


Popular Problems of CSP
• CryptArithmetic (Coding alphabets to numbers)
• n-Queen (In an n-queen problem, n queens should
be placed in a nXn matrix such that no queen
shares the same row, column or diagonal)
• Map Coloring (Coloring different regions of map
ensuring no adjacent regions have the same color)
• Crossword (Everyday puzzles appearing in
newspapers)
• Sudoku (A number grid)
• Latin Square Problem

Lecture 17- Constraint Satisfaction Problems 14


Reading Assignment
• 6.1.2 Example Problem: Job Scheduling
• from Artificial Intelligence : A Modern
Approach 3rd Ed. By S. russel & P. Norvig.

Lecture 17- Constraint Satisfaction Problems 15

You might also like