Concept:
• Search algorithms in AI are categorized by the amount of information they possess about the goal.
• Uninformed search (blind search) only has the problem definition (start, goal test, successor function).
• Informed search (heuristic search) uses additional guidance called a heuristic function \(h(n)\).
Step 1: Define Uninformed Search
Algorithms like BFS and DFS (Options B and C) explore the state space tree without knowing if one non-goal node is "more promising" than another.
They follow a fixed strategy (expanding the shallowest or deepest node).
They only use the basic definition of the problem.
Step 2: Define Informed Search
Informed search (Option A) uses domain-specific knowledge to estimate the distance to the goal.
This is represented by a heuristic function. For example, in pathfinding, the "Straight Line Distance" is specific knowledge that helps the search prioritize nodes in the right direction.
This knowledge is "beyond the definition" because it requires understanding the semantics of the states (e.g., coordinates in space).
Step 3: Identify the correct match
Since the question asks for the search that uses "problem specific knowledge", Informed search is the only appropriate term.