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

> no fair changing the rules

Which rules do you apply?

> For a size of 1024 x 1024, run time is estimated to be either the twelfth of never,

Depends on the rules.

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

Wikisyntax for the Monastery}

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

Replies are listed 'Best First'.
Re^5: Code challenge: Route planning on a 2D grid by tybalt89 (Monsignor) on Mar 14, 2020 at 16:19 UTC
The original rules.	[reply]
Re^6: Code challenge: Route planning on a 2D grid by LanX (Saint) on Mar 14, 2020 at 16:25 UTC
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}	[reply]
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
Re^9: Code challenge: Route planning on a 2D grid by tybalt89 (Monsignor) on Mar 14, 2020 at 17:22 UTC