Ah...

Sorry for thinking out loud, but I wanted to correct a flaw I made. In the last example that I had posted with the red path.... that path would not have been choosen as the final path. The correct path still would have been used.

I won't go into details, but sorting the neighbor nodes by distance still seems like a great solution. I'll code it once I have a chance. I could leave them unsorted, but sorting them during the initialization stage will potentially save time during the actual pathfinding.

Cheers!
- Bret