Breadth-first search
	n Expand shallowest unexpanded node n Implementation: n fringe is a FIFO queue, i.e., new successors go at end