Blind search Vs Heuristic search

Blind search

• No information about the number of steps (or) path cost from current state to goal state
• Less effective in search method
• Problem to be solved with the given information

Heuristic search

• The path cost from the current state to the goal state is calculated, to select the minimum path cost as the next state.
• Additional information can be added as assumption to solve the problem
• More effective in search method

There are six Uninformed Search Algorithms

1. Breadth First Search

2. Uniform-cost search

3. Depth-first search

4. Depth-limited search

5. Iterative deepening depth-first search

6. Bidirectional Search

There are three Informed Search Algorithms

1. Best First Search

2. Greedy Search

3. A* Search