Understanding MinConflicts algorithm
<p>In wikipedia it is written (<a href="https://en.wikipedia.org/wiki/Min-conflicts_algorithm" rel="nofollow noreferrer">Min-conflicts algorithm</a>):</p>

<blockquote>
<pre><code>value &lt;-- the value v for var that minimizes CONFLICTS(var,v,current,csp)
</code></pre>
</blockquote>

<p>but what does that mean?</p>

<p>For example if I have the following matrix for the N queen problem:</p>

<pre><code>  0 1 2 3
0 Q - - -
1 - Q - -
2 - - Q -
3 - - - Q
</code></pre>

<p>Here we have 3 conflicts, right?</p>

<p>What would be the value of the CONFLICTS function if we move the queen on position 1,1 to position 2,3 getting:</p>

<pre><code>  0 1 2 3
0 Q - - -
1 - - - -
2 - - Q -
3 - Q - Q
</code></pre>

<p>Should CONFLICTS return 2 or should it return 4? In other words should we count only the conflicts of this particular queen or should we count all conflicts  globally on the board.</p>

<p>Wikipedia also says</p>

<blockquote>
  <p>The CONFLICTS function counts the number of constraints violated by a particular object, given that the state of the rest of the assignment is known</p>
</blockquote>

<p>but this doesn't feel right.</p>