Filter options:

Freebase Commons Common /common

  • In computer science, the min conflicts algorithm is a search algorithm or heuristic method to solve constraint satisfaction problems. Given an initial assignment of values to all the variables of a CSP, the algorithm randomly selects a variable from the set of variables with conflicts violating one or more constraints of the CSP. Then it assigns to this variable the value with that minimizes the number of conflicts. If there is more than one value with a minimum number of conflicts, it chooses one randomly. This process of random variable selection and min-conflict value assignment is iterated until a solution is found or a pre-selected maximum number of iterations is reached. Because a CSP can be interpreted as a local search problem when all the variables have an assigned value, the min conflicts algorithm can be seen as a repair heuristic that chooses the state with the minimum number of conflicts.