0
$\begingroup$

I am studying Csp and I don't understand the line no 1.1 . Does queue contains all arcs or not?Explain with me 4-queens please.

1. Function AC-3MAC(Q,CV)
   1.1 Q ← {(V i ,V cv ) in arcs(G),i>cv} % start with arcs going to cv 
   cv means current variable
2. Begin
3.     consistent := true;
4.     While not (empty?(Q)) and consistent
5.     Do Begin
6.         (i,j) := pop(Q);
7.         if revise(i,j)
8.         then begin
9.             consistent := not(empty?(domain[i]));
10.            Q:=Q U {(k,I) | (k,I) in arcs(G) & k<>j & k>cv}
11.        end;
12.    end;
13.    consistent←not Empty Di;
14. end;
$\endgroup$
  • $\begingroup$ Please credit the original source of all copied material. It seems like the comment after step 1 answers your question. $\endgroup$ – D.W. Feb 6 at 18:55
  • $\begingroup$ So,let's consider with 4-queen problem. Variable={x1,x2,x3,x4}. Domain= {1,2,3,4}. if x1=1,the queue is {(x2,x1),(x3,x2),(x4,x3)} at first step.It's right? $\endgroup$ – Thuriya Thwin Feb 7 at 1:56

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.