Solutions to two-colors (#89)
| User | Algorithm | Version | Cost | Fastest time | |
|---|---|---|---|---|---|
| jesse | BCP-MAPFM | 1 | 154 | 29.666747ms | View |
| jesse | BCP-MAPFM in-matching | 1 | 154 | 30.636467ms | View |
| noah | Friendly old solver | in_match | 154 | 124.6431ms | View |
| thom | A* + OD + ID with Hungarian heuristic | 1.6.0 | 154 | 1.173393395s | View |
| thom | ICTS (branch-and-bound) | 0.2.7 | 154 | 1.526000581s | View |
| thom | ICTS (branch-and-bound) | 0.2.7 | 154 | 1.616477571s | View |
| thom | A* + OD + ID with branch and bound | 1.6.0 | 154 | 2.222671529s | View |
| thom | A* + OD + ID with branch and bound | 1.6.0 | 154 | 2.22742146s | View |