0
$\begingroup$

i was watching this video: https://www.youtube.com/watch?v=4cCS8rrYT14 and I tried to solve this question:

"Given the variables A, B, C and D, with domain {1, 2, 3, 4} in each of them and restrictions A> B, B = C and D ≠ A, use the AC algorithm."

But the teacher told me that my answer was wrong! He gave me a tip, the tip is: Domain D will not be changed! Below, I will leave my answer step by step, if someone can help me find the error, I appreciate it!

My answer is:

To solve this exercise, it is first necessary to organize the data in order to separate what is the domain, agenda and arc. Step 1

Soon after, we will analyze the first item on the agenda “A> B” with domain A, in order to eliminate unnecessary elements from the domain. step 2.

Analyze domain B with the agenda item “B <A” 3 step

Analyze domain B with the agenda item “B = C” and add the constraint “A> B” 4 Step

Analyze domain D with the agenda item “D ≠ A” and add the constraint “B <A”

5 Step

Analyze domain A with the agenda item “A ≠ D”

6 Step

Analyze domain A with the agenda item “A> B”

7 Step

Analyze domain B with the agenda item “B = C”

8 Step

Analyze domain B with the agenda item “B <A”

9 Step

Result

10 Step

$\endgroup$

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.