The theory that I exercised was that by using a series of quadrants and then measuring the distance to Player1 and Player2 you could read the direction of how to get to the quadrant that is nearest Player1 by reading the instanced direction from the quadrant closest to Player 2 (Similar in theory to a DNS lookup)... Well this worked splendidly!, but I just need help optimizing the IF statements.. so that I don't have to use a bunch of IFs. Thanks for looking and enjoy using this method I created in your own projects!
I have commented the code where I need help. ( UPDATE 11.29.2012 SOLVED! )
Download Gillis CAPX Example File <- My original file
Download R0J0hound optimized CAPX Example File
Watch the Female Character for an example of my Quadralant Path-finding in use!
Thanks for looking