You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
IndependentSubproblemLocalSolver: decomposes a CSP into independent subproblems and solves each with a delegate LocalSolver, mirroring IndependentSubproblemSolver for the local search path
LocalSolver.Factory.INSTANCE: full pipeline wiring — NC + AC3 preprocessing → independent subproblem decomposition → min-conflicts search. NC prunes forced variables (e.g. equalsConstraint(v, true) reduces the domain to {true}); AC3 propagates further. Infeasibility detected during preprocessing short-circuits to Optional.empty()
exactlyOneConstraint optimisation: a single-variable set now emits UnaryValueConstraint(true) instead of ExactlyOneConstraint, which is cheaper and picked up directly by min-conflicts conflict detection without binary expansion
LocalSolver.Factory interface: convenience factory with createLocalSolver(maxAttempts, maxSteps, factory) signature