Improving the Efficiency of Forward Checking Algorithm for Solving Constraint Satisfaction Problems

There are various problems concerning artificial intelligence which can be stated in the from of constraint satisfaction problems (CSP). These problems are defined by a set of variables and a set of constraints in the range of selectable values for variables. Solution of this problem is a set of values for variables so that all constraints of the problem are satisfied. A part of algorithms for CSP are forward algorithms. They are used to check consistency and constraint propagation. The most famous forward algorithm, is forward checking algorithm (FCA). In this article we are going to introduce FCA and suggest two algorithms to improve efficiency of forward.