Explain A* Algorithm. Where it is used?

199views

written 7.2 years ago by

teamques10 ★ 70k

Minimizing the total estimated solution cost

The most widely known form of best-first search is called A∗A search (pronounced “A-star ∗SEARCH

search”).

It evaluates nodes by combining g(n), the cost to reach the node, and h(n), the cost to get from the node to the goal:

f(n) = g(n) + …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT