Research And Implementation For Intelligent Search Algorithm

The artificial intelligence is a hot topic in the field of computer research, and it's application sphere is very broad, and the search based on artificial intelligence has a good application prospect. My paper is based on the traditional searching algorithm , analyzes its good and bad points carefully, inherits its merit, and makes the improvement to its shortcoming to it's being. Compared with the traditional searching algorithm, the search serviceability and the grade of service have a obvious promotion.My thesis is to design a intelligence search system, which can exactly, swiftly realize inference process according to the rule which agrees beforehand after a research on the common traits of search. The system can solve such a kind of problem. If the initial state of things is known, the final state of things is knows, the mode of operation for each unit is known, so we can judge each unit according to the above conditions. If the members can "move", moving it and then proceed to the next round of the judgment. This design's concrete manifestation is to play the game of pushing boxes. Computer must find a path by which boxes can be pushed to the proper positions, and this path must be the shortest, and find a solution to the problem similar to this.My thesis's highlight lies in: compared with the traditional search, this search can visit certain spots redundantly. The traditional search algorithm can visit one spot only once, can't visit it twice, which reduce it's application field. This algorithm can not only visit automaticly, but also can return if necessary, so it's application field can be broadened.