Pathfinding algorithm questions

I was looking at using pathfinding algorithms for generating paths on a map between randomized tiles. I was just wondering if there was a specific algorithm or approach that would help with, rather than selecting the shortest path, selecting a specific path from a variety of paths. In the image, I want to get a path like the blue path, not the brown path, because straight/diagonal lines are boring :P.

CopyableCougar4

Well there are various path smoothing algorithms to take straight-line paths and bend them into curves. Might look into those.
You could also add random noise to the cost metrics, although it probably won’t look good.

You could also tinker with the costs associated with going diagonal vs strait.
Program it biased to not repeat it’s last move.
Should only require a Boolean (switch) and a Numeric (weight).