The algorithm is widely used in path-finding and graph traversal problems. It is an extension of Edsger Dijkstra's algorithm (1959). A* achieves better performance (with respect to time) by using heuristic function.

Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) described the algorithm in 1968.

It is a best-search first algorithm (best-search first alg. is estimating the promise of node n by a function f(n) tha is actually "heuristic evaluation function" f(n), so f(n) = h(n) ).

A* algorithm uses f(n) as well but it consits of two parts:

1. cost function to the node = known distance from the starting node to the current node 'n' - usually denoted g(n)

2. a future path-cost, which is an admissible "heuristic estimate" of the distance from the current node 'n' to the goal - usually denoted h(n)

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

**Demo**

The demo below demonstrates how A* algorithm works. There are 2 grey rectangles. The left one is the start position and the right one is the position we want to get. Obviously there are also obstacles between them so the algorithm has to find the way around them.

## Comments

12face a la place, surmonte, aux deux ailes, de deux petites

lanternes, ou belvederes, de tres-bon gout, qu'un auteur signale, dans un livre d'architecture,

comme un modele d'elegance.

massage lyon: http://www.sophiechassat.com

spam remarks? If so how do you prevent it, any plugin or anything you can advise?

I get so much lately it's driving me mad so any help is very much

appreciated.

but after checking through some of the post I realized

it's new to me. Nonetheless, I'm definitely glad I found it and I'll be bookmarking and checking back often!

a leisure account it. Glance complicated to more added

agreeable from you! By the way, how can we keep in touch?

good, keep up writing.

give you a shout out from Humble Texas! Just wanted to mention keep up the excellent

work!

I'll be coming back to your blog for more soon.

which i am going to deliver in institution of higher education.

I've found something which helped restaurants near me on map: http://restaurantsnearme.space.

Many thanks!

12RSS feed for comments to this post