本文主要是介绍[LS]The Constraint Satisfaction Problems，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
A CSP is a tuple (Z, D, C), where Z is a finite set of variables, D defines a finite set Dx, called the domain of x, for each x 2 Z, and C is a finite set of constraints restricting the combination of values that the variables can take。
可以理解为
z = {x1 , x2 , x3 ... xn}
D = {D1 , D2 , D3 , ... ,Dn} 其中Di = [ai,bi]为xi的范围
C = {C1 , C2,...,Cm} 其中Cj = 一个限制条件，例如 x1 + x2 > 10
CSP 可以简单理解为一个多元方程寻求最优解，实际举例有n皇后问题，有点像多模态。
用LS来解决有很大好处：[]
(1) they use very little memory—usually a constant amount; and (2) they can often find reasonable solutions in large or infinite (continuous) state spaces for which systematic algorithms are unsuitable.
这篇关于[LS]The Constraint Satisfaction Problems的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
