This strategy can find solutions more efficiently than an uninformed strategy. The general approach we will consider is called best – first search.

Best – first search is an instance of the general TREE – SEARCH or GRAPH – SEARCH algorithm in which a node is selected for expansion based …