A novel computation for AI-Searching technology of VCN

Abstract

This paper bases itself upon the deep analyzing and discussing of both BFS (breadth-first searches) & DFS (depth-first searches) in searching without information, and points out that, merits and demerits of two methods on searching without information in FCN (fixed carrying numbers). And then, it introduces a novel problem-solving method which sometimes we must think simultaneously over the synthetic technique combining BFS & DFS in AI-searching technology of VCN (variable carrying numbers), and gives out an example of this practical problem-solving method, namely it such as catching fish with casting a net or boy-herder picks peaches by climbing up a tree.