Search Techniques in AI

Problem solving in AI heavily relies on search algorithms to explore potential solutions.
These methods can be classified into two main types:

1. Uninformed (Blind) Search – No additional knowledge about the problem is available.
   • Examples: Breadth-First Search, Depth-First Search, Uniform Cost Search.
2. Informed (Heuristic) Search – Uses domain-specific knowledge to guide the search.
   • Examples: Best-First Search, A* Algorithm, Greedy Search.

For example, A* search uses heuristics to estimate the cost to reach the goal, allowing the system to find the shortest path efficiently.
Search techniques are the heart of intelligent reasoning, enabling systems like Google Maps, robot navigation, and automated planning.