Shift 1 of 3
Board total: 0 coins
Assign all 8 drivers first.
π Night complete
β¦
1shift / 3
0drivers placed
0score / 3000
How it plays. You're the night dispatcher. Each shift hands you
8 drivers and 8 deliveries; every driverβdelivery pair pays a
fixed amount (the number in its cell). Build a perfect assignment β
every driver gets exactly one delivery, every delivery exactly one driver β
to maximize the board total. Clicking a cell assigns that driver there and
clears any conflicting pick.
score per shift = round(1000 Γ your total Γ· shift optimum)
The shift optimum is the true maximum: all 40,320 possible assignments are brute-forced in your browser when the shift loads.
final score = sum of the 3 shift scores (max 3000).
Think Hungarian, or just brute force β the board is small enough.
The shift optimum is the true maximum: all 40,320 possible assignments are brute-forced in your browser when the shift loads.
final score = sum of the 3 shift scores (max 3000).