It typically constructs a tree of options branching from the root node and identifies all successor nodes at each node. Depth first search pursues the best next node from the current node. Even simple problems can have very large problem spaces. A salesman has a list of cities to visit once. There are direct routes between each pair of cities on the list.
Heuristics are rules of thumb which improve efficiency.
Human problem solvers use heuristics all the time, e.g., choosing which part of the haystack to look in. Heuristics are domain-specific knowledge, usually elicited from experts. Note the example of the travelling salesman s nearest neighbour heuristic. Heuristics mean we accept reasonable rather than best solutions. Assessing solution options Heuristics are either embodied in problem space operators themselves, or applied by a heuristic function.