Tree Search 101: BFS

• Breadth-first search: queue nodes

• Requires O(b(d-1)) space and O(bd) time

• Not a practical method: uses too much space

• •Finds ``shortest'' solutions for pathfinding

• •Covers space well