Heuristic Search

• ·        Aim of heuristic search is to save processing time
• ·        It gives accurate result instead of 100% solution
• ·        Search space is very large; means No exhaustive search is possible
• ·        It has three states in searching

1.      Goal State – Desired result

2.      Current State

3.      Initial state

• ·        In search space we search path or nodes
• ·        State (what we get initially) is directly proportional to objective function (change in state)
• ·        Generate and test
• ·        Here all possible things == search space

·        Generate = select one point from search space and test it, that it is a goal state or not