Monday 5 December 2016

Hello friends :)
If you face any problem to understand any topic of M.Tech. and B.Tech. of Computer Science and Engg.
Tell me topic.
I will try to explain it in my way.
You also can ask any query.
I will try to answer them as soon as I can.

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