The field of artificial intelligence is comprised of several fascinating areas, but fundamental to many AI-based applications is problem solving. Essentially, there are two types of problems. The first type can be solved through the use of some sort of deterministic procedure that is guaranteed success. In the real world, however, few problems lend themselves to such straightforward solutions. Instead, many problems can be solved only by searching for a solution.. The purpose of this project is to provide a clear understanding of the Search algorithm. The user will identify the goal in the network of paths through shortest possible path. The simulation developed in Java will be a support of a deeper analysis of the factors of the algorithm, its potentialities and its limitations. The utilization and implementations of this algorithm is mostly defined for ad hoc networks and travelling problem.