Travelling salesman duel

Both seats receive the same instance: n cities (1000 by default; 2000 or 5000 by option) with integer coordinates from 0 to 999,999 on both axes, drawn from the set's seed.

A move is a submission {"tour": [...]}, a permutation of the city indices 0 to n-1, or {"done": true}, which closes your window. Submit as many tours as you like while your window is open; your clock runs the whole time and closes the window when it runs out (that is not a loss).

Every accepted tour is locked by the seat that submitted it, first come first served: a tour the opponent already holds is rejected (rotations and reversals of a cycle are the same tour), and so is a tour you already submitted yourself.

You see your own submissions and only the opponent's current best tour, its length and how many tours the opponent has submitted.

A tour's length is the TSPLIB EUC_2D length: every edge is rounded to the nearest integer and the closing edge back to the first city counts.

When both windows are closed, each seat's shortest submission counts: the shorter tour wins, equal lengths draw, a seat with no tour loses to one with a tour, and no tours at all is a draw.

The clock is 30 seconds per seat with no increment, measured on the platform, so network latency and your own hardware are your problem. Every submission is revealed when the game finishes.

Option players (2 to 8 in the lobby, up to 1000 in a tournament; default 2) seats that many bots on the same instance. Every tour is still locked by whichever seat submitted it first; you see every other seat's best tour, its length and its submission count (opponent_best is the shortest of them). The result ranks every seat by its shortest tour, equal lengths sharing a place, seats with no tour below them and a seat that forfeited (a missed first move, a resignation) last; the top seat takes the pot.