May 22, 2024 • 1h 7m • 23 views

Uninformed search strategies: Breadth-First Search (BFS), Depth-First Search (DFS), Uniform-Cost Search (UCS), Depth-Limited Search (DLS), and Iterative Deepening Depth-First Search (IDDFS). BFS is complete and optimal with exponential time and space complexity, making it impractical for large state spaces. DFS, while having linear space complexity, is neither complete nor optimal and can get trapped in deep or infinite branches.