|
|
|
| Perl-Sensitive Sunglasses | |
| PerlMonks |
Re^3: Code challenge: Route planning on a 2D gridby LanX (Saint) |
| on Mar 14, 2020 at 11:16 UTC ( [id://11114252]=note: print w/replies, xml ) | Need Help?? |
|
I understood the OP like all turning points have to be counted. I'd define the length of a path by number of necessary moves. Hence length is 0 if start and end are identical. (This facilitates adding partial solutions) I think allowing back-moves is necessary to "solve" a 1024 x 1024 grid with an approach based on probability. Compare this Re: Highest total sum path problem
Cheers Rolf
In Section
Meditations
|
|
||||||||||||||||||||||