Study on the Improved Ac6 Algorithm Based on Table Constraints

Arc consistency (AC) series algorithm is a natural and simple method to deal with constraint satisfaction problem, and AC6 algorithm is the algorithm with optimal time and space complexity in the mainstream AC series algorithm. This article through to the AC6 algorithm data structure and complexity of time and research, this paper proposes a possible - if the storage constraints, support the list of values to add a constraints information storage, and then in the cycle of lookup failure again after traversal, can be directly out from the constraint support value list constraint relation information, thereby reducing the time constraints on finding the traversal. This paper analyzes this possibility and verifies its feasibility through cases and data. Experimental results show that this method can improve the time efficiency of the algorithm.