in reply to Re^3: Highest total sum path problem
in thread Highest total sum path problem
b) this is not legal... each cell can only be visited once (but if this was associated to some fintech problem where total sum is your account balance, I guess this would be a good way to boost it up :D )
c)Yes you can go offline if the number of moves is higher that the total sum of the path toward the final value (cell), but this only holds if a path already exists. If it is the initial search then there is no reference and the condition does not hold (at least one path (solution) needs to exist )
thnx I did not catch those conditions but now that you mentioned it i see how they are crucial for the problem
by helping you I helped myself. Thank you !!!