Breadth First Search
MERGE = add to end
- treat list as a queue
- new search states to explore at end of list,
What about when many new states created?
- We use a heuristic to decide what order to add new states
Breadth first considers all states at a given depth in the search tree before going on to the next depth
- compare with depth-first,
- depth-first considers all children of current node before any other nodes in the search tree
- list can be exponential size -- all nodes at given depth