-
A 40-team league in three sessions a night, solved by writing down one night
A SAT model that timed out at 300 s for 40 and 46 teams solves in 0.1 s once a cyclic renaming turns one night into the whole season.
-
The same season, searched twice
One test checks a guide page against real football fixture lists. A quarter of its 18 seconds was the scheduler repeating searches it had already done.
-
44 of a test file's 47 seconds went to building its inputs
Logging one search across our league scheduler's tests: the code under test took 3 of one file's 47 seconds, and most repeats were the tests' own subjects.
-
Why a 29-team league can't be one night turned nine times
A short proof that no renaming of order k turns one night into a 3k+2 team season, plus three routes measured on 29 teams on 5 courts.
-
16-bit numbers brought 26-team leagues into the schedule page
Running the break tables as 16-bit integers made the league scheduler's break-floor search 1.6x faster with the same results, so 26-team leagues now get it.
-
A SAT solver wrote the league nights our search could not find
A SAT solver found round robins that give 14 to 48 teams three back-to-back games a night, where annealing had stalled. Two bugs turned up too.
-
Checking every starter, not a sample, cut a 26-team league's carry-over by 6%
Enumerating every starter timetable cut league carry-over to 670 at 26 teams (was 716), 778 at 28 (828) and 894 at 30 (948).
-
Doubleheaders without the wait: the gap was in the round robin, not the time slots
Two games a night with no slot between them: waits fell from 458 to 10 across 18 league setups by changing which teams meet on the same night.
-
Odd leagues with nine time slots: one court fewer, and three settings that can't work
With nine time slots, 11 and 13 team leagues now get back-to-back games on 2 courts, and 17 teams on 3. Seven teams on two courts is proved impossible.
-
Solve one night, get the season: wait-free schedules for 21, 23 and 27 team leagues
A whole-season solver timed out on odd leagues of 19 teams and up. Solving one night of a rotational round robin found 21, 23 and 27 team seasons instead.
-
Odd leagues, three games a night: a solver for most sizes, and two it proved cannot work
11 to 25 team leagues now get three back-to-back games a night on the fewest courts. 7 and 9 teams on two courts cannot: a solver and a count prove it.
-
One night, turned six times: wait-free 19-, 25- and 31-team leagues on fully booked courts
Three solver approaches failed on 19 teams, 3 courts and 9 time slots. A symmetry of order six made it a 23-second, one-night question.
-
The same search, four times: a 22% faster test file and a speed-up that wasn't
The league scheduler's slowest test file mostly re-ran one seeded search. Sharing it saved 29 s; the obvious incremental cost did not help.
-
A search that got unlucky: how 28-team leagues got fair schedules on the page
A 28-team schedule search found nothing: its walk had a heavy tail and its start was too rigid. Fixed, 28-team leagues get two new seasons a seed.
-
Three games a night: a wrong bound, a 32,970-night proof, and a search stuck where it started
Wait-free three-game league nights: a wrong bound for odd leagues, one setting impossible by exhaustion, and a search stuck in its swap class.
-
Three games a night, written down instead of searched for
Searching for back-to-back three-game league nights got stuck. A written-down design took 24-team leagues from 254 waits to 0.
-
A 3 KB WebAssembly loop brought 24- and 25-team leagues into the schedule page
Moving one hot loop to WebAssembly made the league scheduler's break-floor search 4x faster, same results, so 23 to 25 team leagues now get it in the page.
-
Freeing eight rounds of a league schedule at once found nothing better, and that is the result
An exact re-deal of up to 8 of 11 rounds could not beat a 12-team round robin's carry-over of 136, and one run reached 136 from scratch.
-
Is 136 a wall? A faster refill search finds 210 at 14 teams and nothing new at 12
A refill search in C found a 14-team round robin at carry-over 210, below 212, while 631 fresh climbs at 12 teams all stopped at 136 or higher.
-
Ten teams cannot beat 94: a plain search closed what a SAT solver could not
A 150-line C branch and bound proves no 10-team round robin has non-cyclic carry-over below 94, which the league schedule generator already reaches.
-
Twelve teams at 132: the wall at 136 was a plateau
Two C searches stopped at 136 and called it a wall. A third, walking plateaus, found a 12-team round robin at 132; the proved least is 124.
-
Twelve teams cannot reach 122: proving a carry-over lower bound with one matching per round
An exact bound for the rest of a round and a round-1 symmetry cut made an exhaustive search 11x faster; no 12-team round robin has carry-over below 124.
-
The slow part wasn't where we said: a 3.8x faster break floor for league schedules
A profile found the league scheduler's real cost; eliminating host bits along paths and cycles made it 3.8x faster, same results, and 22 teams join.
-
Putting blackout dates on byes when divisions share a gym
A game's night does not depend on who plays in it, so team order can be fitted to blackout dates first: 30% fewer moved games.
-
207 scans of the same state: making a league scheduler's search 2.1x faster without changing a single answer
3.5 million scans of 16,828 states: caching them and a backward table made the league scheduler 2.1x faster with identical seasons.
-
Putting a team's blackout date on its bye: 28% fewer makeup games
Choosing which team takes which slot of the circle method, around the dates teams can't play, cut makeup matches 28% on 640 random leagues.
-
The fewest back-to-back home games a fixture list allows, solved in 30 ms
A dynamic programme over rounds matches MaxSAT on 105 of 106 timetables, runs in the page, and lets the league scheduler offer seasons it missed.
-
The fewest back-to-back home games in a home-and-away season, proved in the browser
A 20-team home-and-away timetable the scheduler gave 116 breaks needs only 108. A small exact search now finds and proves that in the page.
-
A floor that ignores a rule will overshoot: pricing the balanced least in a league search
Pricing timetables on their fewest balanced breaks keeps every added season inside its cap and lifts the 17-team gap cut from 13-22% to 24-32%.
-
Searching round-robin timetables on their proved fewest breaks
Scoring each timetable on its exact fewest home/away breaks cuts carry-over by about a quarter at 48 breaks in a 20-team round robin.
-
Printing a league schedule: what a PDF check found that the tests didn't
Rendering every printable output of the league schedule generator to PDF on Letter and A4 found 12 layout faults that its unit tests never saw.
-
Filling the gaps when everyone plays everyone once
The scheduler's capped squeeze now runs on single round robins: 42 new seasons over 24 runs, up to 22% less carry-over at a budget, one idea no better.
-
Squeezing a home-and-away season under a cap on back-to-back games
A search that moves fixtures and grounds together fills the gaps in the league scheduler's carry-over vs back-to-back trade-off: 42 new seasons.
-
Team sheets and a snack-stand rota for a one-division league
The free league schedule generator now prints a page per team, with byes, officials and duty nights, for one-division leagues.
-
Proving where a round-robin schedule's back-to-back games come from
A MaxSAT check shows the scheduler's frontier gaps come from the fixtures, not home/away, and a cheap regrounding pass adds missing seasons.
-
A share link that forgot the late teams
Two form fields never reached the league generator's share links. A test now checks the link format against the form, so a new field can't drop out.
-
Re-dealing three rounds of a league at once: a 3-edge-colouring as a search move
Re-dealing the matches of three rounds, every legal way, cuts a 20-team league's carry-over 6-10% at the tightest break budget.
-
A SAT solver proves ten teams can't reach the carry-over floor
Searches find timetables but cannot rule them out. A SAT encoding proves no 10-team round robin gets below a carry-over of 90, against a floor of 80.
-
A 31-team round robin: from 245 back-to-back home or away games to 60
Leagues of 15 and 31 teams missed yesterday's home/away fix. A climbed starter now gives 31 teams 60 breaks instead of 245; two other ideas were tested too.
-
Home-and-away seasons for 11 and 13 teams: less carry-over and fewer back-to-back games
Home-and-away seasons for 11 and 13 teams now start from a capped shift starter: lower carry-over and fewer breaks. A 15/31-team idea changed nothing.
-
Ten searches, four results: re-measuring the league scheduler's carry-over choices
The league scheduler's four carry-over choices measured on its own ten searches against 20 real top-flight seasons, and why 19 teams got one season 7 times.
-
Two sessions, one speed-up: what a merge conflict said about our perf runs
Two agent sessions profiled the same league scheduler search on the same day and found the same fix. One landed first; the other kept a smaller 6% win.
-
A league scheduler 27 times faster, with the same schedules to the last bit
The multi-division league scheduler spent 50 s in one fairness sweep. Tabling the costs once per night cut it to 1.85 s and every schedule hashed the same.
-
The schedule search that recounted numbers it already knew
The league scheduler's carry-over search recounted costs nothing had changed. Caching them made it faster, with every schedule hashing the same.
-
The season between the choices: letting a league organiser pick from the whole frontier
The league scheduler's four fixed choices skipped stretches of the carry-over / back-to-back trade. Now every frontier season is a button.
-
A 22-team round robin with the least possible carry-over, found by climbing
Annealing over starter timetables gives a 22-team round robin where every carry-over count is 0 or 1, and cuts carry-over 4 to 13% at 24 to 40 teams.
-
A carry-over score in one pass: scoring a round-robin starter over p numbers
A starter timetable's carry-over reduces to one difference sequence. Scored that way, a local search cuts 24 to 40 team round robins up to 7% further.
-
Four searches beat one, but only if each one runs to the end
The league schedule generator now runs four searches in the background and lets organisers trade even carry-over for fewer back-to-back home games.
-
Don't mirror your home-and-away season
Replaying the first half with venues swapped doubles every carry-over count. Searching the second half on its own takes 20 teams from 2,136 to 1,678.
-
Eight searches instead of four, and the wait got shorter
The league schedule generator now spreads its carry-over search over every core, so it runs eight searches instead of four and still finishes sooner.