G5 AIAI Introduction to AI. Blind Searching. Graham Kendall. Problem Definition - 1. Initial State The initial state of the problem, defined in some suitable manner Operator A set of actions that moves the problem from one state to another. Problem Definition - 1.
Function BREADTH-FIRST-SEARCH(problem) returns a solution or failure
Time and memory requirements for breadth-first search, assuming a branching factor of 10, 100 bytes per node and searching 1000 nodes/second
B = Branching factor
D = Depth of solution
M = Maximum depth of the search tree
L = Depth Limit
End of Blind Searches