I think this problem is very closed to this: http://acm.uva.es/p/v1/116.html Which the differences: your problem searches for the bigger final sum, not lesser as the example, and the values can be negatives too. :D
2007/5/8, max <[EMAIL PROTECTED]>: > > > 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 > > > > > -- Victor Carvalho --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
