in reply to Re^2: Highest total sum path problemin thread Highest total sum path problem
Hello baxy77bax,
you need to rethink your requirements. If you want to have the minimum number of moves, you only have two possibilities: