Syntactic Confectionery Delight | |
PerlMonks |
Re: Highest total sum path problemby LanX (Saint) |
on Mar 04, 2020 at 11:09 UTC ( [id://11113760]=note: print w/replies, xml ) | Need Help?? |
> so that the number of moves (summing operations) from x to that position is the minimum possible and the total sum (summarized values) of the path is the maximum possible. Too fuzzy, as usual. You have two criteria to optimize, without telling us which one has to be prioritized.
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|