Breadth-First Search (BFS) is a graph traversal algorithm that explores all neighbors at the present depth before moving to nodes at the next depth level. It's perfect for finding the shortest path in unweighted graphs.
In this game, you'll learn BFS by finding the shortest path from the start node (green) to the target node (red).