Greedy search
	• This is one of the simplest BestFS strategy. • Heuristic function: h(n) - prediction of path cost left to the goal. • Greedy Search: “To minimize the estimated cost to reach the goal”. • The node whose state is judged to be closest to the goal state is always expanded first. • Two route-finding methods (1) Straight line distance; (2) minimum Manhattan Distance - movements constrained to horizontal and vertical directions.