“Perfect Information Search”
		• Suppose that “by magic” (by an “oracle” in CS parlance) we knew the True minimum cost from any node N to the goal • I.e. suppose we know  hT(n) • In UCS we can expect to know gT(n) • True min cost, fT(n) for “going via n”,       fT(n) = gT(n) + hT(n)