Logistics
Minimalist 3D Bin Packing & Universal CSP Solver
Superposition + Markov Chain — One algorithm, any NP-complete problem
API Endpoints
POST
/pack
3D Bin Packing
POST
/color
Graph Coloring
POST
/sat
Boolean Satisfiability
POST
/sudoku
Sudoku Solver
POST
/nqueens
N-Queens
GET
/paper
Technical paper
GET
/health
Health check
Playground
3D Packing
N-Queens
Coloring
Sudoku
Items (one per line: width depth height)
5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5
Container (width depth height)
Pack
Click "Pack" to solve...
Board size (n)
Solve
Click "Solve"...
Adjacency (JSON: {"vertex": ["neighbor", ...]})
{"0":["1","4","5"],"1":["0","2","6"],"2":["1","3","7"],"3":["2","4","8"],"4":["3","0","9"],"5":["0","7","8"],"6":["1","8","9"],"7":["2","5","9"],"8":["3","5","6"],"9":["4","6","7"]}
Number of colors
Color
Click "Color"...
Grid (9 rows, 0 = empty)
5 3 0 0 7 0 0 0 0 6 0 0 1 9 5 0 0 0 0 9 8 0 0 0 0 6 0 8 0 0 0 6 0 0 0 3 4 0 0 8 0 3 0 0 1 7 0 0 0 2 0 0 0 6 0 6 0 0 0 0 2 8 0 0 0 0 4 1 9 0 0 5 0 0 0 0 8 0 0 7 9
Solve
Click "Solve"...