The relevant lines from the wikipedia page:
var <-- a randomly chosen variable from the set of conflicted variables CONFLICTED[csp]
value <-- the value v for var that minimizes CONFLICTS(var,v,current,csp)
set var = value in current_state
var
represents the position of queen C or D, chosen at random.- Set
var
to the position for said queen that minimizes conflicts given the rest of the board
So, it's your first choice, "the algoryth choose randomly to move either C or D...", but not "because both of them create the same number of conflicts." Either C or D because those participate in one or more conflicts.
It does mention "If there is more than one value with a minimum number of conflicts, it chooses one randomly." Once you understand the basic formulation of the algorithm, it seems there may be this modification which may also be considered a min-constraints search.