• Summary of g(n), h(n), f(n) = g(n) + h(n), as well as h*(n), the hypothetical perfect heuristic:

    n   g(n)      h(n)    f(n)    h*(n)
    S    0         8       8	   9
    A    1         8       9       9
    B    5         4       9       4
    C    8         3      11       5
    D    4        inf     inf     inf
    E    8        inf     inf     inf
    G   10/9/13    0     10/9/13   0

    Notice that since h(n) <= h*(n) for all n, h is admissible
    Optimal path = S B G
    Cost of the optimal path = 9