Non-binary Constraint Hybrid Search Algorithm
多元约束混合搜索算法研究

Searching is the key step of constraint solving.Most of search algorithms are based on binary constraint or de- signed upon a single search strategy.Six hybrid search algo- rithms(BM_GASBJ,BM_GBJ,BM_CBJ,FC_GASBJ,FC_GBJ, FC_CBJ)based on non-binary constraint are illustrated.The hybrid algorithms are blended by various search algorithms or strategies.The differences of these hybrid algorithms are pointed out and analyzed.The constraint solving system we designed implements all of the hybrid algorithms.The results indicate that the new algorithms have a higher searching efficiency and improve the performance of the constraint solving system.