wonderful video, really helped me understand the concept. However, I wish you had included some discussion of the overall time complexity of this algorithm
The algorithms have the same outcome and the same inventor, AC-3 is officially what is most popular and on average most efficient. The difference however is that General Arc Consistency handles n-ary constraints whereas AC-3 works up to binary constraints, thus GAC is an extension of AC-3.
Dont you think that if we remove 2 from B which will make E have more domains to satisfy for itself and will not conflict with E and also with A? I mean is there a better way than arc consistency to perform constraint propagation?
Thanks for the Video, but I though generalized arc-cons was all about having higher arity constraints than binary. I thought the arity of the constraints is the difference between ACX (AC3, Ac2001...) and GAC.
Thanks! Just helped me figuring this out! I'm taking this online classes edx.org/courses/BerkeleyX/CS188.1x/2012_Fall And was struggling to understand the other professor...
