Algorithms For Dummies

 

»

Pure heuristic search: The algorithm expands nodes in order of their cost. It 

maintains two lists. The closed list contains the nodes it has already explored; 

the open list contains the nodes it must yet explore. In each iteration, the 

algorithm expands the node with the lowest possible cost. All its child nodes 

are placed in the closed list and the individual child node costs are calculated. 

The algorithm sends the child nodes with a low cost back to the open list and 

deletes the child nodes with a high cost. Consequently, the algorithm per-

forms an intelligent, cost-based search for the solution.