There could be a dual problem which has to be minimised. (The skipped cells that is).
In these cases one could use standard minimisation algorithms.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
In reply to Re^2: Highest total sum path problem
by LanX
in thread Highest total sum path problem
by baxy77bax
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |