Questions tagged [constraint-satisfaction-problems]

For questions about constraint satisfaction problems.

Filter by
Sorted by
Tagged with
0
votes
0answers
11 views

Algorithm for pretty printing CSP graph visualization to be easy to understand?

I'm trying to come up with an algorithm to print complex CSP graphs in a easy to understand manner. I originally thought maybe to center constraints around their domain nodes but that probably won't ...
1
vote
0answers
15 views

How to calculate constraint check in nqueen of AIMA CSP?

I am testing aima csp of java code and I want to know how the constraint check of these problems described in AIMA book is got.
1
vote
0answers
21 views

Write Constraint Satisfaction Formulation for problem

Given $F_1,F_2,..,F_n$ as set of final exams of subjects taken by students $S_1,..,S_k$ in h slots such that no student takes two exams in a single slot.Here the objective is to maximize the number of ...
0
votes
0answers
42 views

Can AC-3 algorithm solve N-Queens problem?

I am building CSP NQueens solver and apply the AC-3 algorithm.But,the domain reduction doesn't occur and gets more search time.How does it happen?Is it a nature of AC-3 algorithm?
2
votes
0answers
25 views

What is local consistency in constraint satisfaction problems?

In the Constraint Propagation in CSP, it is often stated that pre-processing can solve the whole problem, so no search is required at all. And the key idea is local consistency. What does this ...
1
vote
1answer
40 views

Understanding Constraint Search

What is the goal of a constraint solver? How are constraints propagated in a constraint satisfaction search? Any references are also appreciated.
1
vote
1answer
57 views

Daily life example of SAT Problem

What would be one good daily life example of SAT problem? I've thought about this one: The problem of placing a bunch of different kinds of glasses in a shared cabinet in such a way that some ...
0
votes
0answers
54 views

How to solve constraint satisfaction problem of two queen and two knights on a $4 \times 4$ grid?

Consider the problem of placing 2 knights and 2 queens on a $4 \times 4$ chessboard, each piece (knight or queen) per row (denoted by R1, R2, R3, and R4), such that no two pieces are attacking each ...