title: What is the difference between Greedy-Search and Uniform-Cost-Search?
body: <p>When searching in a tree, my understanding of uniform cost search is that for a given node A, having child nodes B,C,D with associated costs of (10, 5, 7), my algorithm will choose C, as it has a lower cost. After expanding C, I see nodes E, F, G with costs of (40, 50, 60). It will choose 40, as it has the minimum value from both 3.</p>
  
  <p>Now, isn't it just the same as doing a Greedy-Search, where you always choose what seems to be the best action?</p>
  
  <p>Also, when defining costs from going from certain nodes to others, should we consider the whole cost from the beginning of the tree to the current node, or just the cost itself from going from node n to node n'?</p>
  
  <p>Thanks</p>