What do you mean by heuristic search? Given following state space representation, show how greedy best firsh and A^* search is used to find the goal state.

S is the start state and G is the goal state. The heuristics of the states are:

h(S) = 12, h(A)=8, h(D)=9, h(B)=7, h(E)= 4, h(C)=5, h(F)=2, h(G)=0.