In search process, after selecting the variable for value assignment, another question is about the value the current variable will take. The answer of this question depends on the value ordering strategy used by the search algorithm. For example, there may be a strategy that initiates the variable to the value in its domain which is more likely to lead a solution. By this way, the probability of reaching a solution at the end of the current branch increases. However, if all the solutions are required or there are no feasible solution, value ordering strategy has no effect on solution time, since all the value assignments are tried.