A* algorithm in artificial intelligence in hindi | a* algorithm in ai | a* algorithm with example

It is best-known form of Best First search. It avoids expanding paths that are already expensive, but expands most promising paths first.

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

g(n) the cost (so far) to reach the node
h(n) estimated cost to get from the node to the goal
f(n) estimated total cost of path through n to goal. It is implemented using priority queue by increasing f(n).

Follow us on :
Facebook :   / wellacademy  
Instagram :   / well_academy  
Twitter :   / well_academy  


a* algorithm in ai,
a* algorithm in artificial intelligence examples,
a* algorithm in hindi,
a* algorithm in artificial intelligence in english,
a* algorithm in artificial intelligence notes,
a* algorithm in artificial intelligence tutorial,
a* search algorithm in hindi,
a* algorithm in artificial intelligence,
a* algorithm in artificial intelligence in hindi