Repository navigation
Order Red puzzle and Tantrix algorithms by reliability and speed - #69
Merged
Merged
Conversation
…ly they solve, from the benchmarks 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.
Red: min-conflicts, tabu search, global simulated annealing, genetic searches, then iterated local search, variable neighborhood search and annealing, then the ones that get stuck. Order from docs/benchmarks.md and a 12 run comparison on one machine. Tantrix: variable neighborhood search before iterated local search (it solved more at 12 and 15 tiles); the rest was already in benchmark order. The exact solvers and generic searches without benchmark data keep their places.
Generated by Claude Code