Thanks Guys, I see now that this is actually a very simple problem. I used a simplified version of Dijkstra's algorithm, this problem reduces to an acyclic graph so the negative weights are not big deal. It is just a breadth first search, which is pretty much what you were saying. For an n*n chess board my algorithm runs in n^3.
Max --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
