in reply to Re: Highest total sum path problem
in thread Highest total sum path problem
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
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: Highest total sum path problem
by baxy77bax (Deacon) on Mar 05, 2020 at 17:17 UTC |