Week 2 — Blind Search

The two functions that define every search problem — how states, moves, and goals turn real problems into graphs a search algorithm can walk

  1. MoveGen and the State Space

    The two functions that define every search problem — how states, moves, and goals turn real problems into graphs a search algorithm can walk

  2. Depth-First Search (DFS)

    The impetuous search — dive deep, backtrack late. Linear space but no shortest-path guarantee

  3. Breadth-First Search (BFS)

    The conservative search — sweep level by level. Guaranteed shortest path, but Open explodes exponentially

  4. Depth-First Iterative Deepening (DFID)

    The best of both worlds — BFS's shortest-path guarantee at DFS's linear memory cost, for only ~11% overhead