Search Algorithm
Definition
A search algorithm examines possible data or states to find a goal, a solution, or a suitable path.
A search algorithm explores a state or data space for a goal, a solution, or an optimal path.
Simply explained
Like systematically going through possible paths: a procedure determines which possibility is checked next.
Why it matters in practice
The term helps to select, develop, evaluate AI systems in a well-founded manner and realistically assess their technical risks.
Example from business
A route planner uses A* to find a cost-effective path through a road network.
Limits and pitfalls
- Inappropriate heuristics, huge state spaces, and incorrect cost functions can worsen runtime or results.
Origin & history
Breadth-first, depth-first, and heuristic search have been fundamental methods since the beginnings of computer science and AI.
Use in mid-sized companies
- Possible application: A route planner uses A* to find a cost-effective path through a road network.
Frequently asked questions
What does search algorithm mean?
A search algorithm explores a state or data space for a goal, a solution, or an optimal path. What should you watch out for? Inappropriate heuristics, huge state spaces, and incorrect cost functions can worsen runtime or results.
Sources
- Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths · Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Source checked on 10.10.2026. Editorial use cases are hypothetical; no evidence of real customer results.
Editorially reviewed on: