Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^4: Highest total sum path problem

by baxy77bax (Deacon)
on Mar 05, 2020 at 17:03 UTC ( #11113860=note: print w/replies, xml ) Need Help??


in reply to Re^3: Highest total sum path problem
in thread Highest total sum path problem

a) It is legal to do a tour of the matrix and pick up as many high value cells as possible. :)

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 !!!

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://11113860]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (2)
As of 2021-10-24 19:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My first memorable Perl project was:







    Results (89 votes). Check out past polls.

    Notices?