Artificial Intelligence · Level 2 of 5
Breadth-First Search
A search that explores all nodes at one depth before going deeper.
It finds shortest paths by number of edges in unweighted graphs.
Example
A maze solver checks all one-step moves before two-step moves.
Listen to the definition and example
Audio transcript
Breadth-First Search. A search that explores all nodes at one depth before going deeper. It finds shortest paths by number of edges in unweighted graphs. For example: A maze solver checks all one-step moves before two-step moves.
Explore this concept
Why it matters
These distinctions help you separate a system’s task, representation, and reasoning method.
Related concepts
Quick recall question
Try answering before looking back at the definition.