Repository navigation
Red puzzle: order all algorithms by measured time - #70
Merged
Merged
Conversation
…flicts and tabu search come before the slow exact searches Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_0175jMLxrP7wZ3vfj6UfeDZx
This file contains hidden or 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
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.
The dropdown still listed the exact searches first, as a block. This orders every algorithm by median time over 12 runs on one machine (all exact searches, min-conflicts and tabu solved 12/12): fast backtracking 2 ms, hand crafted brute force 3, generic brute force 7, IDA* 8, A* 14 and 18, concurrent depth 22, min-conflicts 24, concurrent optimum and breadth 36 and 37, tabu 51; then global annealing (9/12), the genetic searches, ILS, VNS, annealing, and the ones that never solve it. The test that required all exact searches first is replaced by checks that the quickest is first, brute force over orderings is last, and min-conflicts and tabu come before every strategy that does not always solve it.
Generated by Claude Code