[barrybecker4]

A plan (docs only) for adding tabu search, min-conflicts and adaptive restarts, which suit problems with exactly one right answer better than plain genetic search. Nothing is built yet; this is for review.

• Why: solve rate, not fitness in a fixed time, is what matters for puzzles, and the numbers from the earlier phases (Red 5/12, Tantrix 4/6 for genetic search) show room.
• What each technique needs: moves for integer arrays (SetValue), Move.attributes, Optimizee.conflictedPositions, enumerateMoves. Restarts need nothing new; BudgetedOptimizee already ends a run.
• A decision rule: a strategy joins OptimizationStrategyType only if it beats the best existing strategy on solve rate (or equals it in clearly less time) on the new constraint benchmark.
• Phases A to F, six PRs, with restarts first. Phase A is a constraint benchmark (N-queens, graph coloring, all-interval series) with solve rate reporting.
• Risks, what is out of scope, and three open questions with defaults.

---

Generated by Claude Code

[barrybecker4]

already in #37