Breadth-first search
A search strategy that explores all states at each depth level before moving to the next deeper level. Breadth-first search guarantees finding the shortest solution path but requires storing all frontier states, making it memory-intensive for large problem spaces.