Solutions to Matching and independence (#15)
| User | Algorithm | Version | Cost | Fastest time | |
|---|---|---|---|---|---|
| jesse | BCP-MAPFM | 1 | 162 | 48.265054ms | View |
| jesse | BCP-MAPFM | 1 | 162 | 48.800516ms | View |
| jesse | BCP-MAPFM | 1 | 162 | 50.807971ms | View |
| ivar | A* + OD + ID with exhaustive matching (110) | 1.5.0 | 162 | 125.9607ms | View |
| thom | ICTS (branch-and-bound) | 0.1.0 | 162 | 170.356171ms | View |
| noah | Friendly old solver | I lost track | 162 | 242.5104ms | View |
| jonathan | prematch M* + OD | 0.0.1 | 162 | 277.760506ms | View |
| jesse | BCP-MAPFM | 1 | 162 | 342.280131ms | View |
| robbin | R.CBM.MCF | 30aaae4 | 162 | 571.593285ms | View |
| thom | ICTS (exhaustive with sorting) | 0.1.7 | 162 | 1.159783967s | View |