Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re^3: Highest total sum path problem

by Ratazong (Monsignor)
on Mar 04, 2020 at 12:42 UTC ( #11113765=note: print w/replies, xml ) Need Help??


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

Hello baxy77bax,

you need to rethink your requirements. If you want to have the minimum number of moves, you only have two possibilities:

  • slide from aa to ba and then to bb
  • slide from aa to ab and then to bb
any other solution would have a longer path. And calculating the maximum sum for these two paths is rather trivial ...

HTH, Rata

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2020-05-27 23:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    If programming languages were movie genres, Perl would be:















    Results (162 votes). Check out past polls.

    Notices?