This is the most popular Artificial Intelligence Interview Questions asked in an interview. Searching is the universal techniques used in AI problem techniques. This algorithm is used to search a particular position. Every search terminology has some components.

Problem space: this is the environment in which the search takes place.
Problem Instance: it’s a result of the Initial State + Goal state.
Problem Space Graph: This is used to represent a problem state.
The depth of a problem: Here we can define the length of the shortest path.
Space Complexity: We can calculate this by the maximum number of nodes that are stored in memory.
Time Complexity: It is defined as the maximum number of nodes that are created.
Admissibility: This is the property of the algorithms that are used to find the optimal solutions.
Branching Factors: This can be calculated by the average number of child nodes in the problem space graph.
Depth: it is the length of the shortest path from inception to the goal state.
Here are some of the search algorithms

Breadth-first search
Depth-first search
Bidirectional search
Uniform cost search