maximum sum path in a 2d matrix with the following conditions:--

1.one has to start with the left most column but any row.
2.it can move right, up or down.
3.once a cell has been visited it cannot be visited again.
i just need the logic with algorithm please.

• its a question related or the same question of an ant moving from on cell to another and taking a right turn at every corner and once visited cell has to be cancelled and use the corresponding cell available
• 8 years agoHelpfull: Yes(0) No(0)
• No it is not....please read the conditions again.....if u can solve it please provide a link....
• 8 years agoHelpfull: Yes(0) No(0)