Uniform-cost search
	n Expand least-cost unexpanded node n Implementation: n fringe = queue ordered by path cost n Equivalent to breadth-first if step costs all equal n Complete? Yes, if step cost ≥ ε n Time? # of nodes with g ≤ cost of optimal solution, O(bceiling(C*/ ε)) where C* is the cost of the optimal solution n Space? # of nodes with g ≤ cost of optimal solution, O(bceiling(C*/ ε)) n Optimal? Yes – nodes expanded in increasing order of g(n)