The search algorithms in this section have no additional information on the goal node other than the one provided in the problem definition.

The plans to reach the goal state from the start state differ only by the order and/or length of actions. Uninformed search is also called Blind search.

The following  algorithms are discussed in this section.

1. Depth First Search.

2. Breadth-First Search.