A* G value

Okay, so i have followed a the pseudocode for an A* algorithm. But i still do not have a clear understanding of what the G value is. I have looked at 3 different pseudocodes but they are all not clear enough for me.

So if anyone can tell me what exactly it is in a clear explanation it would be very much appreciated. Maybe a link to a more understandable pseudocode would be nice too.
This is the least understandable question I have ever read!
You'll have to either explain what an A* Algorithm is or give a hyperlink that will show us.
A* is a quite known search algorithm: http://en.wikipedia.org/wiki/A*_search_algorithm
I can't explain what a G value is. I have several times written A*, but not once did I have anything called G..
g(n) represents the cost of the path from the starting point to any vertex n.
h(n) represents the heuristic estimated cost from vertex n to the goal.

A* moves to the next vertex n for which f(n) is the lowest, such that f(n) is the sum of g(n) and h(n).
Last edited on
Topic archived. No new replies allowed.