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 reply to Re^3: Highest total sum path problem
by LanX
in thread Highest total sum path problem
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |