Breadth-first search - WikipediaAnimated example of a breadth-first search. Black: explored, grey: queued to be explored later on BFS on Maze-solving algorithm Top part of Tic-tac-toe game tree Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next
