Quote:Original post by Ezbez There's another way to get that straight line, too. I'm guessing that currently a diagnal move is equivilant to a straight move. However, if you make one diagnal move equivilant to 1.41 (the distance between the two centers of the squares) moves, it should find that the straight line is the shorter of the two and choose it (assuming that you have it choose the shortest possible path).
That won't work. The two paths in the diagram that Kaanin posted would have the same length under this definition of length as well.
Not an answer to this specific question, but another option would be to REMOVE any node between two nodes when there's no collision to block a straight movement between these 2 nodes.
In your example, you'd end up with 2 nodes... your start and your finish.
Quote:Original post by Kaanin ZOMG KrazeIke thank you SOO MUCH! This accursed thing has been plagueing me for days now. I could kiss you but Im guessing your a dude and I just dont swing that way. I just...wow, thank you so much.
Right... too bad no hit wonder's answer was perfectly sufficient and if you are decent at coming up with algorithms equivelant to KrazeIke's answer.
Everyone hates #1.That's why a lot of idiots complain about WoW, the current president, and why they all loved google so much when it was new.Forget the fact that WoW is the greatest game ever created, our president rocks and the brainless buffons of America care more about how articulate you are than your decision making skills, and that google supports adware, spyware, and communism.
