title: What is the worst case for A* search algorithm?
body: <p>Under what conditions will the A* search algorithm explore all the states in the search space?
  Is this the worst case?</p>
  
  <p>According to me, it will be forced to search the entire search space if f(n) for each node on the route to the goal, is higher than the other nodes on the same level.
  This is the worst case since all the nodes generated must be expanded to reach the goal.</p>
  
  <p>Is this correct?</p>