Breadth First Search

#uninformed

  1. Start by searching all immediately reachable states
  2. Search all immediately reachable states of those states
  3. Repeat
  • Def. Newly found states are put at the bottom of the priority queue
  • Guarantees the shortest (but not least costly) path.
  • Requires a lot of memory

Session 3 - BFS Example 2.png#invert