Assign every agent to a distinct task for the lowest total cost.

Each agent must take exactly one task, and no two agents share a task. Pick each agent's task to minimize the total cost across the whole roster.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

Total cost

Agent 0

Agent 1

Agent 2

Agent 3

Agent 4

Agent 5

The Dispatch — practice the decision, scored against the optimum

What does the The Dispatch puzzle teach?

Assign N agents to N distinct tasks for minimum total cost — a min-cost matching, not a row-by-row greedy. Each agent's own cheapest task collides on shared favourites and overpays.

Why do interviews ask about this?

The assignment problem is the canonical don't-greedily-give-each-agent-its-own-best-option trap — the answer is min-cost perfect matching, solved exactly here with a 2^N bitmask DP.

How is it scored?

The engine computes the provably-optimal answer for the exact instance you played (dynamic programming, shortest-path, or exhaustive search — never a heuristic) and scores your attempt as a percentage of it. No login needed to see your score.

← Arena

Practice0:00

The Dispatch · D5

Assign every agent to a distinct task for the lowest total cost.

Each agent must take exactly one task, and no two agents share a task. Pick each agent's task to minimize the total cost across the whole roster.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

Total cost

Agent 0

Agent 1

Agent 2

Agent 3

Agent 4

Agent 5