Min-conflicts algorithm
id:
min-conflicts-algorithm-178-14324082
title:
Min-conflicts algorithm
text:
In computer science, a min-conflicts algorithm is a search algorithm or heuristic method to solve constraint satisfaction problems. One such algorithm is min-conflicts hill-climbing. Given an initial assignment of values to all the variables of a constraint satisfaction problem, select a variable from the set of variables with conflicts violating one or more of its constraints. Assign to this variable a value that minimizes the number of conflicts. Repeat this process of conflicted variable sele
brand slug:
wiki
category slug:
encyclopedia
description:
Search algorithm or heuristic method to solve constraint satisfaction problems
original url:
https://en.wikipedia.org/wiki/Min-conflicts_algorithm
date created:
2005-06-06T11:23:42Z
date modified:
2024-09-04T15:37:07Z
main entity:
{"identifier":"Q6862473","url":"https://www.wikidata.org/entity/Q6862473"}
image:
fields total:
13
integrity:
15