Use WalkingDistance as cost/heuristic #7521
Draft
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Since diagonal steps are the same framecount as cardinal steps there's no reason to treat them any differently. Lets us simplify the cost and heuristic functions.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Since diagonal steps are the same framecount as cardinal steps there's no reason to treat them any differently. Lets us simplify the cost and heuristic functions.
This isn't a proper fix for #2404, just something I was playing around with while finding test cases for glebm's pathfinding refactor. It doesn't appear to be any worse than vanilla's logic and lets max length paths occur more often so might be useful as a temp measure?