@article{(Open Science Index):https://publications.waset.org/pdf/2428, title = {Optimal Solution of Constraint Satisfaction Problems}, author = {Jeffrey L. Duffany}, country = {}, institution = {}, abstract = {An optimal solution for a large number of constraint satisfaction problems can be found using the technique of substitution and elimination of variables analogous to the technique that is used to solve systems of equations. A decision function f(A)=max(A2) is used to determine which variables to eliminate. The algorithm can be expressed in six lines and is remarkable in both its simplicity and its ability to find an optimal solution. However it is inefficient in that it needs to square the updated A matrix after each variable elimination. To overcome this inefficiency the algorithm is analyzed and it is shown that the A matrix only needs to be squared once at the first step of the algorithm and then incrementally updated for subsequent steps, resulting in significant improvement and an algorithm complexity of O(n3).}, journal = {International Journal of Computer and Information Engineering}, volume = {3}, number = {1}, year = {2009}, pages = {216 - 219}, ee = {https://publications.waset.org/pdf/2428}, url = {https://publications.waset.org/vol/25}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 25, 2009}, }