http://qs321.pair.com?node_id=11113765


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:

any other solution would have a longer path. And calculating the maximum sum for these two paths is rather trivial ...

HTH, Rata

In Section Seekers of Perl Wisdom