Search is the enumeration of a state space: finding the optimal solution by exhausting all possibilities, or counting the number of valid solutions.
There are many ways to optimize search, such as reducing the state space, changing the search order, and pruning.
Search is the foundation of some advanced algorithms. In OI, pure search is often also a way to obtain partial points, but very few problems can be solved for full points using pure search.