I think this can be converted into Dijkstra's algorithm to find the minimum distance between the start and end points. (the weights would be negative of the points between two cells).
On Mon, Apr 29, 2013 at 4:12 PM, sreekanth guru <sreekanth.i...@gmail.com>wrote: > > Problem: > > We have m * n grids. Each grid can have one of earth/water/mines. You can > go to top/bottom/left/right adjacent grids. You can go to adjacent grids > only when it is filled with earth/mines. you can't travers water filled > grids. To travel to adjacent grid you need to sacrifice 2 points. If you > travers mines(each mine will have some positive score) the points in that > mine will be added to your score. Now given any starting position find out > max score loop(end point should be same as start point). > > P.S. - All mine grid points can be used only once. If you traverse mine > second time you won't get any points. > > > -sree > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
