Study
CS-725 route
Unit 3 · Lesson 1 of 5 5 min

Problem Formulation and State Space Search

Before a machine can search, it must turn a messy task into states, actions, a goal test and a path cost.

What this unit covers

Unit 3: Uninformed Search Strategies

  1. 1 Problem Formulation and State Space SearchBefore a machine can search, it must turn a messy task into states, actions, a goal test and a path cost. · 5 min
  2. 2 Tree Search, Graph Search and the FrontierEvery search algorithm grows a search tree, and the shape of one data structure, the frontier, decides everything. · 3 min
  3. 3 Breadth-First Search (BFS)Knock on every door on the ground floor before climbing a single stair — that's how breadth-first search finds the nearest goal. · 4 min
  4. 4 Depth-First Search (DFS)Down the rabbit hole: plunge down one branch to the very bottom, then back up and try the next. · 4 min
  5. 5 Uniform Cost Search (UCS)Cheapest first: when roads have different lengths, count the cost, not the steps. · 7 min