monce-optimization
Playground
Paper
Math
Architecture
Economics
Dashboard
Playground
Pick a problem, encode it, see the uniform 3-SAT intermediate, solve via npdollars.
Problem type
Sudoku (9×9)
Graph Coloring
k-Clique
Vertex Cover
Subset Sum
Input (JSON)
{"grid": "53..7....6..195....98....6.8...6...34..8.3..17...2...6.6....28....419..5....8..79"}
Budget (s):
Reduce only
Solve