|
|
|
|
|
|
by JonChesterfield
489 days ago
|
|
|
A lot of the research on constraint solvers is to solve that problem. CSP is more approachable than boolean SAT or SMT but it's all the same sort of thing - feed it a lot of constraints and some notion of when a solution is better than another one and then leave it running for a while. |
|
|