Slides / VideoAdvanced
Uninformed Search: Breadth-First Search
Breadth-First Search explores a state space level by level using a FIFO queue, guaranteeing the shortest path in unweighted graphs.
1 / 6
Breadth-First Search explores a state space level by level using a FIFO queue, guaranteeing the shortest path in unweighted graphs.