n. a first-in, first-out strategy used in graph search wherein two states are examined recursively. After visiting the present state first and finding out that it is not the goal state, shift attention to the sibling state. If the sibling state is not the goal again, then move on to the first branch (child) of the first state and continue the process.
BREADTH-FIRST SEARCH: “Since the breadth-first search follows first-in, first-out queueing, it arrives at the goal through a process of elimination.”