To use A* to solve MSUB44, one must supply a Supergraphs

The next step is to find an algorithm for finding paths in P2, then apply this al!drithin in a certain way as a heuristic Many combinatorially large problems cannot be solved for P1. As an elementary example, the rectilinear distance feasibly by exhaustive case analysis or brute force function is an efficient heuristic for finding paths in a search, but can be solved efficiently if a heuristic can be "Manhattan street pattern" graph even when some (but devised to guide the search. Finding such a heuristic for not too many) of the streets have been blockaded (i.e., a given problem, however, usually requires an exercise of some edges are removed from the. graph).