DRAFT ORDER
v1.3.0

FAIR TICKET DRAFTS · v1.3.0

About Draft Order

Original formulation and search

The draft-order formulation and original exhaustive search are by Owen Bartlett, Dan Bartlett, and David Torney, authors of Construction of fair ticket-draft orders. David Torney supplied the original Python code.

David Torney’s algorithm description ↗

Additional development

G. Matthew Fricke, Department of Computer Science and Center for Advanced Research Computing, University of New Mexico, developed the branch-and-bound implementation, parallel execution, equivalence analysis, benchmarks, packaging, and tests.

AI acknowledgments

Claude Fable 5.1, GPT Terra 5.6, and GPT Astra 6 were used for code generation and debugging, and assisted with proof development and LaTeX typesetting.

Copyright in the original implementation remains with its respective holders.

Repository and authorship ↗Copyright and attribution ↗

LESS GUESSWORK. FAIRER TURNS.

A fair turn
for everyone.

Sharing season tickets? Tell us how many games each person gets. We’ll find the order in which you choose them.

01 / YOUR GROUP

Who’s picking?

21 picks
Draft settings
Try an example:

Searches for the lowest unfairness score and checks whether it is optimal.

Up to 16 people and 64 picks. Maximum search time: 10 minutes. Results stay in this browser for 24 hours. Download a copy to keep them.

02 / YOUR DRAFT

The picking order

Ready

Everyone gets their share.

We arrange the turns so each person’s picks stay close to their ideal spacing.

Your group chooses the actual games, one turn at a time.

01

Set the shares

Enter the agreed number of picks for each participant. These shares stay fixed.

02

Find the balance

Exact search seeks the lowest cumulative spacing unfairness. If time runs out, a candidate may remain unproved.

03

Make your picks

Follow the numbered order. Each person chooses from the games still available.