It's just like Dyanamic programming graph problem ...u can apply dijkstra's shortest path..only thing u have more constraints to look out..
On 5/4/07, max <[EMAIL PROTECTED]> wrote: > > > Say you have an n*n "chessboard" where each square is associated with > a real number (pos or neg). You want to navigate from one side to the > other by either moving one space ahead or one space ahead and one > space to the side (either side). I need an relatively efficient > algorithm that will optimize the path so that the sum of the values of > the squares that are touched is maximized. An easy to implement > algorithm would be great. > > Thanks in advance. > Max > > > > > -- *************************************************************** 30 years from now it doesn't matter which shoe you wore,which branded jean you wore..what all matters is WHAT YOU HAVE LEARNED AND HOW YOU HAVE USED IT. http://students.iiit.ac.in/~koushik_c --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
