Re^6: Code challenge: Route planning on a 2D grid

in reply to Re^5: Code challenge: Route planning on a 2D grid
in thread Code challenge: Route planning on a 2D grid

You mean your interpretation of the original ones I analyzed in Re^2: Highest total sum path problem?

Edit:

I.e slides

are unlimited in length
can go back and forth (overlap)
always just count as one move

?

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery}

Comment on Re^6: Code challenge: Route planning on a 2D grid

Replies are listed 'Best First'.
Re^7: Code challenge: Route planning on a 2D grid by tybalt89 (Monsignor) on Mar 14, 2020 at 16:59 UTC
No. The original rules in this thread. Slides count as the number of cells crossed. Slides can go in any of the four directions. Slides can cross over previously visited cells.	[reply]
Re^8: Code challenge: Route planning on a 2D grid by LanX (Saint) on Mar 14, 2020 at 17:10 UTC
I see. It confused me that you replied to a post with changed rules. Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery}	[reply]
Re^9: Code challenge: Route planning on a 2D grid by tybalt89 (Monsignor) on Mar 14, 2020 at 17:22 UTC
I was complaining about the change of rules for code I wrote yesterday.	[reply]

In Section Meditations