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 CarryingNumbers), 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.

A Magic Game of Numbers Based Intelligent Properties of VCR: You Don't Know Who I Am

“…Obviously, the biggest integer number of VCN for n-Figures in (r+1)-carrying numbers may be computed as the following formula: r n r n-1 r 1 1 00000 0 1 (n-Figures) (n-Zeros) r n (r n-1 +1)(r n-2 +1) (r 1 +1) +r n-1 (r n-2 +1)(r n-3 +1) (r 1 +1) + +r 1 operation of addition, subtraction, multiplication, division, etc. and the computation errors of perturbation motion may be approached to zero.…”