Improving on the restricted path consistency constraint propagation algorithms based on the bitwise

Abstract

The constraint satisfaction problem(CSP) is very important and meaningful in solving the NP-hard problems. The CSP mainly include two parts: the reasoning and searching. The filtering technology is very important in the searching and the consistency algorithm plays the crucial role in the filtering technology. Recently, Kostas Stergiou proposed easily implement algorithm the restricted path consistency3(RPC3) algorithm, which can efficiently work in the whole search. Then he implements the restricted restricted path consistency3(rRPC3) having the similar performance with RPC3, while the rRPC3 is better than RPC3 and most of other consistency algorithms. Then that experiments showed the better effectiveness than other consistency algorithms. In this paper, we proposed a new consistency algorithm rRPC3bit based on the rRPC3 and the arc consistency(AC)+bit ideas. And then the experiments clearly show the rRPC3bit has better results than the rRPC3 algorithms and the state-of-art max-restricted path consistency3(maxRPC3) algorithm light-max-restricted path consistency3-residues multiple(lmaxRPC3rm) in most of test cases. The new rRPC3bit is a very promising algorithm.