Perl: the Markov chain saw | |
PerlMonks |
Re^3: Highest total sum path problemby QM (Parson) |
on Mar 05, 2020 at 11:25 UTC ( [id://11113840]=note: print w/replies, xml ) | Need Help?? |
Can you clarify the problem statement?
For instance, is it legal to try to do a tour of the matrix, to pick up as many high value cells as possible? If the priority is "max sum", followed by "min terms", then a "rook's tour" of the positive valued cells is in order. Another idea, can you revisit a cell? What's to keep you from circling through 4 positive value cells forever? Can you go "offline", by taking a longer tour than necessary? -QM
In Section
Seekers of Perl Wisdom
|
|