Network search algorithms with modifiable heuristics

Most of the previous studies in heuristic search have assumed that the heuristic estimate of a node remains constant during the execution of algorithms In a recent study, L. Mero suggested a method for run-time modification of heuristic estimate of nodes. This method of modifiable heuristics can in general reduce the total number of node expansions. It is shown in this paper, with counter examples, that Mero’s algorithm (B′) is not as good as claimed.