We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Is it possible to reverse the algorithm to get the longest path?
The text was updated successfully, but these errors were encountered:
interesting idea but with the way it values the cells, the path would just go backward and never arrive at your destination.
Sorry, something went wrong.
Actually it would eventually reach the destination filling the whole grid and result in the worst possible path :)
No branches or pull requests
Is it possible to reverse the algorithm to get the longest path?
The text was updated successfully, but these errors were encountered: