http://i62.tinypic.com/23hlgcg.jpg

im trying to get a grasp on the A* pathfinding algorithm. Using the image i attached. if the green square represents the start, and red represents the end. wouldn't the algorithm bring me up towards the top of the grid, and then circle me back around, because of the wall?

It would seem the algorithm would never start by moving downward first, because the F cost would initially appear more expensive?

Is this a problem with the basic manhattan heuristic? Or am I just missing something?

I'm trying to get a grasp on the A* pathfinding algorithm. Using the image I attached.

If the green square represents the start, and red represents the end. wouldn't the algorithm bring me up towards the top of the grid, and then circle me back around, because of the wall?

It would seem the algorithm would never start by moving downward first because the F cost would initially appear more expensive?

Is this a problem with the basic manhattan heuristic? Or am I just missing something?