Scheduling and Tournament Sets in CAT DILR: 4 Diagrams

DILR

Eight teams, a round robin group stage, a points table with two rows blanked out, and a note saying ties were broken by goal difference. You read it twice, decide it is doable, and start writing down matches. Nine minutes later you have a page of fixtures, three answers, and no idea whether any of them are right.

Games and tournaments sets are rarely hard in the logical sense. They are hard because they carry more bookkeeping than any other DILR family, and bookkeeping punishes an unstructured start. Aspirants who lose marks on games and tournaments CAT questions usually understood every condition and simply had nowhere consistent to put them.

Why Games Based Sets Punish Good Solvers

A typical arrangement set gives you eight people and six conditions. A tournament set gives you eight teams, twenty eight matches, a points system, a tie breaker and six conditions. The logical depth is similar. The amount you have to hold at once is four times larger.

That difference changes what fails. In an arrangement set you fail by missing a deduction. In a tournament set you fail by losing track of what you already established, which is a memory problem that a structure solves and cleverness does not. This is why two aspirants of equal ability get very different results on the same set.

• You wrote match results in a list rather than a grid, so checking a team's record means rereading everything.
• You never computed the total number of matches, so you had no check on completeness.
• You worked the bracket forwards, so every early guess propagated.
• You treated the points table as data rather than as a set of simultaneous constraints.

Each of those is a setup failure with a fixed cost. Fix the setup and these sets become some of the most reliably scoreable in the section, which matters because they appear often enough to be worth owning.

The Four Shapes Every Games Set Takes

The format sentence at the top of the stem tells you the shape. The table below maps format to structure and names the first calculation worth doing before any condition is read.

Format stated	Structure to draw	Do this first
Every team plays every other	Match grid, teams on both axes	Count total matches with n(n minus 1)/2
Single elimination or knockout	Bracket, drawn from the final backwards	Count rounds, since n teams need n minus 1 matches
Points awarded per result	Points table with a totals row	Compute total points available across all matches
Rounds, days or slots named	Schedule line with time as a column	Count slots and check whether any must stay empty

Why the First Calculation Matters So Much

Each of those opening calculations is a completeness check. If you know twenty eight matches exist and your grid holds twenty six, you know to keep going. Without it you finish early, answer confidently and lose two questions to an incomplete structure that looked finished.

The Fixture Map: 4 Diagrams and When Each Is Right

Read the format line, draw the matching structure, and only then start reading conditions. Thirty seconds spent here is the difference between a set that resolves and a set that has to be restarted.

• Two shapes often coexist. A round robin with points needs both a grid and a table, and they check each other.
• If the set names a venue or a referee as well, add a column rather than a second diagram.
• A bracket with seedings is still a bracket. Seeding constrains who meets whom, not the structure.
• If no format is stated at all, the set is a distribution problem wearing a sports costume.

Round Robin Sets: The Match Grid and Its Arithmetic

A round robin with n teams has n(n minus 1)/2 matches. Eight teams give twenty eight. Six teams give fifteen. Writing that number at the top of the rough sheet before reading any condition is the highest value five seconds in this whole family of sets.

The grid then does the bookkeeping. Teams on both axes, results entered once, the diagonal blanked. Reading a team's record is a row scan rather than a search, and the cell count tells you at a glance how much of the set remains unresolved.

Four Numbers to Write Before Any Condition

• Total matches, from n(n minus 1)/2, doubled if the round robin is played twice.
• Total points available, from the points system multiplied by the match count.
• Matches played per team, which is n minus 1 in a single round robin.
• Maximum possible points for one team, which caps every row in the table.

Those four numbers take under thirty seconds and they bound the entire set. Aspirants who skip them are solving without a ruler, and it shows in the questions that ask what is possible rather than what happened.

Knockout Sets: Draw the Bracket Backwards

Knockout sets tempt you to start at round one, where the information is thinnest. Start at the final instead. The set almost always tells you something about the winner or the finalists, and every deduction from the final constrains two earlier matches rather than one.

The structural facts are small and worth holding. With n teams, exactly n minus 1 matches are played and exactly one team survives each round. Any condition about a team reaching a particular round is therefore a statement about how many matches it won, which is often easier to use than the bracket position itself.

Three Moves That Open a Knockout Set

• Place the eventual winner first, then the losing finalist, then work outward one round at a time.
• Convert every round based condition into a match count for that team before you place anything.
• Check whether the bracket is fixed or drawn. A fixed bracket forbids two named teams from meeting before a stated round.

Points Tables and Schedules: Two Structures That Check Themselves

These two shapes share a property the grid and the bracket do not: both carry internal totals that must balance. That makes them self checking, and it makes an inconsistency visible long before you have finished filling them in.

Points Tables: Work From the Total

A partially filled points table is a system of equations, not a record. Every row must satisfy played equals won plus drawn plus lost, and every column has a total that the format fixes in advance. Two constraints per row and one per column resolve more than most aspirants expect.

Work the totals row first. Total matches played across all teams is twice the number of matches, because each match appears in two rows. Total wins equals total losses. Total points is fixed by the system. Any single blank cell in a table that satisfies those is usually forced.

Schedules: Turn Time Into a Column

Scheduling sets name days, rounds or slots and then constrain who appears when. The mistake is to treat time as a label. Treat it as an axis, with slots as columns and participants as rows, and the ordering conditions become adjacency rules you can apply mechanically.

Order the conditions before you use them, because a schedule resolves in a specific sequence and working out of order means rereading. The priority below holds for almost every scheduling set in this family.

• Absolute placements first. Anything fixing a participant to a named slot is a free entry.
• Prohibitions second. A forbidden slot eliminates a cell without needing anything else resolved.
• Counts third. How many matches per day, or how many participants per slot, bounds whole columns.
• Relative conditions last. Before, after and immediately follows only pay once something is anchored.
• Anything mentioning at least or at most goes in the margin until a count is fixed.

A Worked Tournament Set, Structure First

Six teams play a single round robin. Two points for a win, one each for a draw. At the end, the top team has 8 points and no team has fewer than 2. How many matches were drawn if the total points scored across all teams was 32?

1. Structure. Round robin, so a match grid plus a points table.
2. Opening calculation. Six teams give fifteen matches.
3. Points available. Each match distributes exactly two points, so fifteen matches give thirty points.
4. Contradiction found. The stated total of 32 exceeds 30, so the data as given is inconsistent.
5. What this teaches. The total check catches an impossible configuration in under twenty seconds, which is exactly the trap CAT builds into consistency questions.

That check is worth running on every points based set, including the ones that turn out to be consistent. It takes seconds, it validates your reading of the scoring system, and it occasionally hands you an answer outright. Aspirants who drill it alongside distribution sets from the DILR bank stop losing sets to arithmetic they never checked.

Build the Fixture Map Into Your CAT Preparation Week

These sets reward structured repetition more than volume, because the diagrams are few and the arithmetic is fixed. Three short blocks a week make the choice automatic inside a month.

1. Block one, format spotting. Read ten set stems and write only the format and the opening calculation. Solve none.
2. Block two, structure drawing. Draw the correct structure for the same ten, still without solving.
3. Block three, full sets under time. Solve three complete sets and note where the structure had to change.

Then check it against real wording. Topic-wise CAT exam previous year questions phrase the format line far less obligingly than practice sets do, and that is the gap worth closing before the exam. If your week has no fixed DILR block, the AI study planner for CAT 2026 will hold one and rebuild it when a day slips. Keep your own notes to the four opening numbers, since the free CAT DILR notes and cheatsheets already carry the standard formats.