Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Highest total sum path problem

by baxy77bax (Deacon)
on Mar 04, 2020 at 10:18 UTC ( [id://11113757]=perlquestion: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    
    NxM
    ...
      |-8   -3    2    1  -4   ...
    a>| 0    8    4    0   0
    ...
    
  2. or download this
    My starting position is (a,a) = 0
    My end position is  (b,b) = 10
    
  3. or download this
    pathA: left, up, left, left, up =  0+0+1+2+(-3)+10 = 10
    pathB: left-slide + up-slide = 0+8+10 = 18   
    pathC: up-slide + left + up + left-slide+down = 0+3+0+17+3+10= 33
    
    etc..
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: perlquestion [id://11113757]
Approved by marto
Front-paged by haukex
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others pondering the Monastery: (None)
    As of 2024-04-25 01:21 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      No recent polls found