Welcome to the Monastery | |
PerlMonks |
Re^3: Highest total sum path problemby LanX (Saint) |
on Mar 08, 2020 at 01:36 UTC ( [id://11113957]=note: print w/replies, xml ) | Need Help?? |
>
There are certainly many paths meeting that criterion
most probably automatically constructed from smaller segments like OK not trivial, but well studied and becoming easier with growing number of possible moves (i.e. low number of non-positive cells here) see Hamiltonian Path But the general case is NP complete ... hmm ... ... well ... HaHaHaHaHaHaHaHaHaHa .... HaHaHaHaHaHaHaHaHaHa ;)
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|