In the search algorithm, we determine the starting point as that root of a tree branch, including multiple paths in the direction of the target, we choose from these pathways one of the points to be the new starting point a new phase, and thus point to a new tree root, and so on until we reach the goal. The blind is not Known or the search each time the generation of new phases and then tested these stages, including what it achieves the goal? If so, the search ends, otherwise to be repeated Find generate new stage and so on. Find full-duplex operation is based on two research papers at one...