Uninformed Search Strategies

Uninformed search strategies explore the search space without any prior knowledge about the goal’s location.
Common approaches include:

• Breadth-First Search (BFS): Explores all nodes level by level. Guarantees the shortest path but requires high memory.
• Depth-First Search (DFS): Explores as deep as possible before backtracking. Memory efficient but may get stuck in loops.
• Uniform Cost Search: Expands the least-cost node first — ideal when path costs vary.

These methods are fundamental for understanding how AI explores possibilities exhaustively, especially in simpler or well-defined environments.
Although not always the fastest, uninformed searches guarantee a solution if one exists.