Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Generic Search Methods

Generic Search Methods are GPS for which every problem can be expressed as search

One particular example of a Generic Search Method is the A* algorithm.

A* works for problems that can be represented as a state space i.e. a graph of states. Initial conditions of the problem are represented as start state , goal conditions are represented as end state

A* is an informed search or heuristic search approach that uses the estimation function:

f(n)=g(n)+h(n)

g(n) the cost to get from the star state to current state n

h(n) estimated cost to get from current state n to end state

f(n) estimated total cost from start state through current state n to the end state
More in Lecture 5