I was wondering as what are the specific conditions which make the A* algorithm - optimal in terms of the node expansion over the other Unidirectional algorithms:    When the same heuristic information is given to all the algorithms.  
What are the conditions that make the A* algorithm optimal over the other unidirectional search algorithms
algorithms;algorithm analysis;search algorithms;shortest path