A*

Revision as of 19:12, 14 August 2023 by Ixywas (talk | contribs) (fixed my mistake with the links, i will be adding more info to this page in the future)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A* is a popular[([path finding algorithm]] used for finds parsing using stochastic grammars in [[NLP]]

Definition

A* is mathematically defined as:   n is the next node, g(n) is the cost of the path from the start node to n and h(n) is a [[heuristic]] function that estimates the cost of the cheapest path from n to the goal.

A* terminate a path when the path reached its goal or there is no more place to extend