Constraint Satisfaction Problems (CSPs) 5 - Arc Consistency | Stanford CS221: AI (Autumn 2021)

[@dailyprescriptionofdopamin7796]

This is great, funny to see the Australian state example same as what we're doing here at unimelb

[@jojo-wd4oy]

We use this too in germany and i've seen this example beeing used all over the world :)

[@garlicbread3527]

source material is AI: A Modern Approach, so it's same for everyone

[@Shaan11s]

Same in Texas lol

[@pratyushshrivastava4362]

Sane in India

[@anmol3457]

the source material is the same, so it makes sense

[@hepingshi5866]

For AC-3 algorithm at 10:30, if one of Xi, say X6, has neighbors but that X6' Domain is not changed w.r.t. Xj, does it mean that it won't be added to the queue and won't enforce arc consistency on all X6's neighbors even if they are arc inconsistent w.r.t. X6? Then wouldn't this mean it overlooked some potential inconsistency in all variables?

[@eldi]

6:04 why not? Why wasn't that possible

[@shafaqali7487]

Cuz if green is chosen for N then blue can be satified for q and vice versa.