ABSTRACT
Search technologies are fundamental technologies in computer science and technology. In data structure, search spaces are static, and a search algorithm is used to find items with specified properties among a collection of items. There are three kinds of static search methods for data structure: Sequential Search, Binary Search, and Binary Search Trees. A search problem can be represented as a state space. And a state space can be represented as an implicit graph. The goal for a search problem is to find a path from an initial state to a set of goal states. During the search, a search tree or a search graph is generated in the state space, called a search space. That is, a search space is a part of a state space. The Robot Moving Institute is using a robot in their local store to transport different items. The output contains one line for each block except the last block in the input.
