Breadth First Search

• Breadth First Search starts at the goal and expands all of the paths simultaneously.
• This can be expensive in memory.
• You also have to check for cycles.
• Both BFS and DFS are exhaustive techniques. They both guarantee success eventually.
• Both are uninformed.
• Both work well when the size of the space is small.
• You can also start at the goal and move toward the start.
• You can also start at both ends and meet in the middle.