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

> 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
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery

In Section Seekers of Perl Wisdom