Swiss Tournament Pairing Helper

Propose a next round from entered scores and opponent history, avoiding rematches under a stated informal rule set.

On-device No sign-up Free to use

Propose pairings controls

?

One player per line as "Name, score". Use a finite score from -1000 to 1000, such as 3 or 3.5. A line without a score counts as zero. Up to 16 players.

?

One fixture per line as "Name > Opponent". A line such as "Name > bye" records a bye. Fixtures are read in both directions, so you only need each game once.

?

The most pairing attempts to try before the result is reported as exhausted. Larger values search longer on awkward fields.

Processed in your browser. Your inputs stay on this device.

Showing an example. Change the fields, then use propose pairings to update it.

Result

Showing an example.

Using the six entered scores and five recorded fixtures, propose Ada with Cleo, Ben with Dev and Eve with Finn. None of those three pairs appears in the entered history.

Board 1: Ada (2) with Cleo (1.5).
Board 2: Ben (2) with Dev (1).
Board 3: Eve (0.5) with Finn (0).
There are no byes, and the proposed pairs avoid the entered previous fixture.

Loading the tool. Your result will appear here.

https://usefreetools.net/swiss-tournament-pairing-helper · 20 November 2026

Was this helpful?

How to use Swiss Tournament Pairing Helper

  1. Edit Player scores, or enter Name, score lines in the advanced field. Scores are supplied by you; fixture history does not calculate them.
  2. Record each previous fixture once as Name > Opponent, or Name > bye for a previous bye. Both sides of a fixture are recognized, so do not enter its reverse again.
  3. Set Search steps under Advanced search limits. The search begins with score order, skips previous opponents and backtracks when needed; it does not optimize the total score gap.
  4. Generate and review the proposed pairs and any bye. An exhausted search leaves the answer undecided; an infeasible result means no complete pairing was found after the permitted search was fully explored.
  5. Download swiss-tournament-pairings.csv or swiss-tournament-project.json. Save draft and Load draft retain these input fields explicitly in this browser; update scores and history yourself for the next round.

Example: Swiss Tournament Pairing Helper

Using the six entered scores and five recorded fixtures, propose Ada with Cleo, Ben with Dev and Eve with Finn. None of those three pairs appears in the entered history.

You add
Standings: Ada, 2 Ben, 2 Cleo, 1.5 Dev, 1 Eve, 0.5 Finn, 0 Results so far: Ada > Ben Ada > Dev Ben > Cleo Cleo > Eve Dev > Finn Search steps: 20000
You get
Board 1: Ada (2) with Cleo (1.5). Board 2: Ben (2) with Dev (1). Board 3: Eve (0.5) with Finn (0). There are no byes, and the proposed pairs avoid the entered previous fixture.

Options

Standings
Finite entered scores from -1000 to 1000 are accepted, including whole and fractional values. Search order is descending score, then fewer prior byes and alphabetical name. Final board rows are sorted by the first listed player’s name; history does not update scores.
History and search
Previous opponents cannot meet again. For an odd field, eligible players with no prior bye are tried from lowest score upward, alphabetically for ties. All attempts share one search budget. Exhausted and infeasible are different outcomes.

Supported inputs and limits

  • 2 to 16 case-insensitively distinct players, names up to 60 characters and finite scores from -1000 to 1000.
  • A name without a score counts as zero.
  • Up to 400 history lines; repeated fixtures, including reversed duplicates, and repeated bye entries are refused.
  • Search steps range from 1 to 500,000.
  • No player receives a second bye under these rules.
More details

An odd field with no eligible bye therefore cannot be paired.

A failed result has no completed pairs or assigned bye; it still exports a status record.

Browser drafts save only by explicit controls; deleting the draft leaves current fields in place.

The JSON export is a record, without project-file import.

No official federation rules, chess colors, automatic standings update or optimal score-gap guarantee is implemented.

Where your input is processed

This tool does not upload your inputs. See the limits for anything saved on your device.

A valid next round is not an official Swiss system

The helper finds one pairing under its score-order and history rules. It does not allocate chess colors or implement every federation condition. Keep standings and history with the exported proposal, then apply the tournament rules used by your organizer.

Questions about Swiss Tournament Pairing Helper

Will it derive scores from results?

No. You enter the standings scores yourself.

Can players meet a second time?

Entered previous opponents are excluded from this proposal.

Does exhausted mean impossible?

No. It means the selected search budget ended without a complete answer.

Page updated · Project managed by Tony Hines · Report a problem with Swiss Tournament Pairing Helper