Greedy Search: f(n) = h(n) Consider the following search space where the start state is S and the goal state is G. The left figure shows the arcs labeled with the costs of the associated operators. The right figure shows the states labeled with the value of the heuristic function, h, if it is ever applied at that state.

             S ... Initial State                S 8
            /|\                                /|\
          1/ 5 \8                             / | \
          /  |  \                            /  |  \
         A   B   C                        8 A  B 4  C 3
        /|\  |  /                          /|\  |  /
      3/ 7 9 4 /5                         / | \ | /
      /  |  \|/                          /  |  \|/
     D   E   G .... Goal State          D   E   G  
                                         *   *   0

     Edge Costs                  Heuristic = Estimated Costs = h(n)


    node
    expanded    nodes list
    ----        ------------------
                { S(8) }
      S         { C(3) B(4) A(8) }
      C		{ G(0) B(4) A(8) }
      G		{ B(4) A(8) }

    Solution path found is S C G.  #nodes expanded = 3.

NOT