(20th-March-2021)
• This was devised to deal with situations where the dependence of the factors involved in solving a given problem is very complicated, or where load factors are involved.
• Problem solving by search and constraint satisfaction problem. It was called a weak methods.
• Formulation of the problem centered on the concept of constraints Formalizing the problem We express the observed phenomena as a collection of constraints and efficiently calculate candidates for interpretation that satisfies them. It is effective when the solution candidate is remarkably reduced when considering constraints. Constraint propagation is used to manage the chain of candidate reductions due to constraints.
• Basic concept:Constraint Satisfaction Problem, (CSP) has been studied on the field of artificial intelligence, search problems such as graph problems and puzzles, so-called combination problems. The constraint satisfaction problem is a problem of selecting values from a set of variables such as the following and a set of discrete values corresponding to each variable and assigning values to each variable so as to satisfy all constraints.
Comments