Manhatta Heuristic with as few turns as possible?

Hi I’m tring to get a path from points A to B with possibly 2 straight lines.

The green line is the result I’m getting with Heuristic: Manhattan and Heuristic Scale: 1.3

The red line is what I’m aiming for. Is this possible?


Have you rotated your graphs or used any penalties of any kind?
Usually with the manhattan heuristic it will take the fewest turns if there are no obstacles.