Research And Realization Of General Searching Algorithms Of Combinatorial Problems

This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search. This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms.Firstly the idea of the general searching algorithms is to define one accurate compute model. Then the state space searching algorithms a based on the compute model are submitted. Supposed algorithm b is the concrete searching algorithm for the combinatorial problem P. The parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem P in the way of the state space.The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem. The different material problems have different modules, but the general searching module does not vary with the problems.Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm, the present of the general searching algorithm is the apparent progress for the searching technology.