Lm-Cut heuristic #21
Merged
Lm-Cut heuristic #21
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
|
Thank you for contributing this! I'll take a closer look when I have bit more time next week. |
|
Refactored the implementation a bunch to avoid code reduplication and improve style consistency! I will likely make more performance improvements to the implementation in the main branch (e.g. avoid re-running the entire RPG search multiple times), but I think this can be merged now. Thanks again for contributing this @danielz9999! It was very helpful for understanding how LMCut works and is implemented. |
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.
Adds the Lm-Cut heuristic to heuristics as well as tests for it. Uses a modified version of the relaxed_pgraph_search function to get hmax costs and then runs the Lm-Cut algorithm.