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?
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?
This is great, funny to see the Australian state example same as what we're doing here at unimelb
We use this too in germany and i've seen this example beeing used all over the world :)
source material is AI: A Modern Approach, so it's same for everyone
Same in Texas lol
Sane in India
the source material is the same, so it makes sense
6:04 why not? Why wasn't that possible
Cuz if green is chosen for N then blue can be satified for q and vice versa.