Chapter 4 of 4

100%

CAT Data Interpretation & Logical Reasoning★ ~2-3 of DILR's 22 questions, usually as one dedicated set

Games & Tournaments

Round-robin, knockout and points-table questions all reduce to counting matches correctly first — get that structural count right, and reconstructing standings from partial results becomes routine arithmetic.

⏱ 12 min readMedium difficulty✓ Free · exam-pattern aligned

Timed practiceMCQs from this chapter with instant scoring

FlashcardsFormulas & traps on spaced repetition

CAT PYQsSolved previous-year questions

By the end of this chapter you'll be able to…

1Compute round-robin and double round-robin match counts using combinations
2Apply the n-1 knockout match-count shortcut regardless of bracket structure or byes
3Reconstruct a points table from partial win/draw/loss data under a stated scoring convention
4Compute total match counts for multi-stage (group + knockout) tournaments
5Apply the individual-team-degree cross-check to verify a round-robin match count
6Explain how seeding keeps top players apart in early knockout rounds

💡

Why this chapter matters in CAT

Games and Tournaments questions describe a competition format and ask about the resulting matches or points table. The recurring first step is counting how many matches the format itself produces — round-robin gives a direct combinations count, knockout always gives exactly n-1 regardless of bracket structure — since every points-table question implicitly depends on that count being right.

Before you start — revise these

🔗

Modern Maths

Round-robin and knockout match counts are direct applications of combinations, C(n,2), from that chapter.

🔗

Arithmetic

Points-table reconstruction is direct arithmetic once wins, draws and losses are identified.

🔗

Logical Reasoning

Multi-stage tournament questions often combine with the diagramming discipline used for constraint puzzles.

Games & Tournaments — CAT DILR

Games and Tournaments sets describe a competition format — round-robin, knockout, or a multi-stage combination — and ask questions built on the resulting matches or points table. The recurring first step, regardless of what is actually asked, is counting how many matches the format itself produces, since every points-table question implicitly depends on that count being right.

1. Round-robin format

In a round-robin, every team plays every other team exactly once, so the total number of matches is a direct combinations count:

$Round-robin matches = (2 n) = \frac{n ( n - 1 )}{2}$

For 8 teams: $(2 8) = 28$ matches. A double round-robin (each pair plays twice, typically once at each team's home venue) simply doubles this count: $2 (2 n)$ — for 8 teams, $56$ matches.

A useful cross-check on the total match count comes from each team's individual match total: in a single round-robin, every team plays every other team exactly once, so each of the $n$ teams plays exactly $n - 1$ matches.

Summing this across all $n$ teams counts every match twice (once from each participant's perspective), giving $\frac{n ( n - 1 )}{2}$ — the same $(2 n)$ figure reached a second, independent way. This cross-check is genuinely useful when a question gives partial win/loss data and asks you to verify that the reconstructed table is internally consistent.

2. Knockout format

In a knockout, every match eliminates exactly one team, and the tournament ends when exactly one team remains — so the total number of matches is always exactly $n - 1$ , regardless of how the bracket is arranged. A 16-team knockout needs $15$ matches; this holds even if some teams receive a first-round "bye" (skip a round), since a bye does not eliminate anyone and so does not count as a match.

This $n - 1$ fact is worth stating as a shortcut precisely because it requires no knowledge of the bracket's structure — the number of rounds, whether the bracket is seeded, and how byes are distributed all change how the tournament unfolds, but never change the total match count, since eliminating $n - 1$ teams to leave one champion always takes exactly $n - 1$ matches.

Seeding assigns rankings to players before the draw specifically to keep the strongest players apart in early rounds — the top two seeds are placed in opposite halves of the bracket, the next two seeds in opposite quarters, and so on.

A question describing "seed 1 and seed 2 can meet only in the final" is describing exactly this convention, not an arbitrary rule: it is a direct consequence of placing the top seeds in different halves at every level of the bracket.

3. Points tables

A points table assigns fixed points for a win, a draw, and a loss (commonly 3-1-0 in football-style formats, or 2-1-0 in others), and reconstructing a table from partial information is a direct application of these fixed values. If a team's points, wins and draws are known, its losses follow from the total matches played minus wins minus draws — the points table is rarely more than accounting once the scoring convention is identified correctly.

Trap. Never assume a scoring convention (3-1-0 vs 2-1-0) — it is always stated explicitly in the question, and applying the wrong one to reconstruct a table produces numbers that will not add up, a useful self-check that something was misread.

A team's total matches played equals the sum of its wins, draws and losses, and in a completed round-robin, every team has played exactly $n - 1$ matches — a fact that pins down an unknown "losses" value directly once wins and draws for that team are known.

4. Multi-stage tournaments

A group stage followed by a knockout stage is the most common multi-stage format, and its total match count is the sum of the two stages' counts computed separately — never a single combined formula. If a tournament has 4 groups of 4 teams each, playing round-robin within each group, then the top 2 from each group (8 teams total) advance to a knockout stage:

Group stage: $4 \times (2 4) = 4 \times 6 = 24$ matches. Knockout stage (8 teams): $8 - 1 = 7$ matches. Total: $24 + 7 = 31$ matches.

The two stages must never be conflated — a team's group-stage record and its knockout-stage record are governed by entirely different formats (round-robin allows draws and accumulates points; a knockout match has a single winner and immediately eliminates the loser), and a question mixing "how many points did a team earn overall" needs the group-stage points system applied only within the group stage, with the knockout stage contributing wins/losses in a completely different currency (advancement, not points).

Worked Examples

Example 1 (round-robin — easy). In a round-robin tournament with 10 teams, how many matches are played in total?

$(2 10) = \frac{10 \times 9}{2} = 45$ matches.

Example 2 (double round-robin — easy). A football league has 6 teams, each playing every other team twice (home and away). How many matches are played?

$2 \times (2 6) = 2 \times 15 = 30$ matches.

Example 3 (knockout — easy). A knockout tennis tournament has 32 players. How many matches are played in total, and how many rounds does it take?

Matches: $32 - 1 = 31$ , regardless of bracket structure. Rounds: since each round halves the remaining players ( $32 \to 16 \to 8 \to 4 \to 2 \to 1$ ), it takes $lo g_{2} 32 = 5$ rounds.

Example 4 (points table reconstruction — medium). In a round-robin tournament with 3-1-0 scoring, a team has played all 7 of its matches, won 4 and drawn 2. Find its losses and total points.

Losses $= 7 - 4 - 2 = 1$ . Points $= 4 (3) + 2 (1) + 1 (0) = 12 + 2 + 0 = 14$ .

Example 5 (multi-stage — hard). A tournament has 4 groups of 4 teams, each group playing round-robin, and the top 2 from each group advancing to a straight knockout. Find the total number of matches in the entire tournament.

Group stage: $4 groups \times (2 4) = 4 \times 6 = 24$ matches. Knockout stage: $8$ teams advance (2 from each of 4 groups), needing $8 - 1 = 7$ matches. Total: $24 + 7 = 31$ matches.

Example 6 (knockout with byes — medium). A knockout tournament has 20 players. Since 20 is not a power of 2, some players receive a first-round bye. Find the total number of matches played.

Regardless of how byes are distributed, the total number of matches is always $n - 1 = 20 - 1 = 19$ — byes do not change this, since a bye skips a match without eliminating anyone, and exactly 19 players must still be eliminated to leave one champion.

Example 7 (points table, multi-team reconstruction — hard). In a round-robin tournament with 5 teams (3-1-0 scoring), every team has played all 4 of its matches. Team A has 2 wins and 1 draw. Team B has 1 win and 2 draws. If the tournament had no other draws besides these, find Team A's and Team B's losses and points.

Team A: losses $= 4 - 2 - 1 = 1$ . Points $= 2 (3) + 1 (1) + 1 (0) = 6 + 1 = 7$ .

Team B: losses $= 4 - 1 - 2 = 1$ . Points $= 1 (3) + 2 (1) + 1 (0) = 3 + 2 = 5$ .

As a consistency check: total round-robin matches $= (2 5) = 10$ . Each drawn match involves two teams simultaneously drawing, so the total draws recorded across all teams' individual counts must be an even number — a genuine reconstruction question would supply enough further data about the other three teams for this parity check to confirm the table is fully consistent.

Summary

Count the matches a format produces before attempting any other question about it — round-robin gives $(2 n)$ , double round-robin doubles that, and knockout always gives exactly $n - 1$ regardless of bracket structure or byes.

Points-table reconstruction is direct accounting once the scoring convention (3-1-0, 2-1-0, or otherwise) is correctly identified from the question — never assumed.

In a completed round-robin, every team has played exactly $n - 1$ matches, which pins down an unknown loss count once wins and draws are known.

Multi-stage tournaments sum each stage's match count separately — a group stage's round-robin points and a knockout stage's elimination format are governed by entirely different rules, and must never be conflated in the same computation.

Key formulas & results

Everything to memorise for the exam hall, in one card. Screenshot this for revision.

Round-robin matches

(2 n) = \frac{n ( n - 1 )}{2}

Every team plays every other team exactly once.

Double round-robin

2 (2 n)

Each pair meets twice, typically home and away.

Knockout matches

n-1

Always true regardless of bracket structure, seeding or byes — each match eliminates exactly one team.

Individual match count (round-robin)

Each team plays exactly n - 1 matches

Summing across all n teams and halving recovers the total match count, C(n,2) — a useful cross-check.

Points-table accounting

Losses = matches played - wins - draws

Points = wins × (win value) + draws × (draw value); the scoring convention is always stated explicitly.

Multi-stage total

Total matches = group-stage matches + knockout-stage matches

Computed separately for each stage, never by a single combined formula.

CAT test series

Ready to be tested on this?

Games & Tournaments shows up in every CAT paper — sit a timed one and find out where you actually stand.

2–3Qs in paper

Mediumpriority

Full CAT mocks, real clock
Data Interpretation & Logical Reasoning-only sectionals & chapter tests
All-India rank + topic-level analysis

Free forever · solver-verified questions

⚠️

Traps CAT sets — and how to dodge them

These are the exact option-traps and misreads that cost marks under negative marking.

WATCH OUT

✗ Assuming a knockout's match count depends on the number of rounds or byes

✓ Use n-1 directly — it holds regardless of bracket structure, seeding, or how byes are distributed.

Why it happens: Every match eliminates exactly one team, so reaching one champion from n teams always takes exactly n-1 eliminations.

WATCH OUT

✗ Assuming a fixed scoring convention (e.g. always 3-1-0) without checking the question

✓ Always use the scoring convention explicitly stated in the question — it varies between 3-1-0, 2-1-0 and other schemes.

Why it happens: Applying the wrong convention produces a points total that will not match the given data, though this mismatch is itself a useful self-check.

WATCH OUT

✗ Combining a group stage's round-robin points with a knockout stage's win/loss outcomes into one points figure

✓ Treat the two stages as governed by entirely separate systems; compute each stage's outcome separately.

Why it happens: A round-robin awards points for a draw; a knockout match has no draw and immediately eliminates the loser — the two are not compatible currencies to add together.

WATCH OUT

✗ Forgetting that each drawn match adds a draw to BOTH participating teams' individual counts

✓ When cross-checking a reconstructed table, confirm the total number of draws recorded across all teams is an even number.

Why it happens: A single drawn match is counted once in each of the two teams' individual records, so the sum of individually recorded draws across the whole table must always be even.

WATCH OUT

✗ Assuming the top two seeds could meet in an early round of a seeded knockout

✓ Recall that seeding places the top two seeds in opposite halves of the bracket, so they can meet only in the final at the earliest.

Why it happens: Seeding exists specifically to keep the strongest competitors apart until as late as possible in the tournament.

Exam-pattern practice

PYQ-style questions with full solutions. Work through them as a readiness check — mark yourself honestly and get your gap report at the end.

Readiness check

Are you exam-ready for Games & Tournaments?

10 problems from this chapter. Try each one, reveal the worked solution, mark yourself honestly — get your gap report at the end.

10 questions~7 min worth ~66 marks in CAT exams

5-minute revision

The whole chapter, distilled. Read this the night before the exam.

•Round-robin matches: C(n,2) = n(n-1)/2. Double round-robin doubles this.
•Knockout matches are always n-1, regardless of bracket structure, seeding, or byes.
•Each team in a completed round-robin plays exactly n-1 matches — a useful cross-check via summing and halving.
•Points-table losses = matches played − wins − draws; the scoring convention is always stated explicitly.
•Multi-stage tournaments sum each stage's match count separately, never by one combined formula.
•A drawn match adds a draw to both teams' individual records, so total recorded draws across a table must be even.
•Seeding keeps the top two seeds in opposite halves, so they meet only in the final at the earliest.
•A bye skips a match without eliminating anyone, so it never changes the total n-1 match count.

CAT question blueprint

How this topic is asked, tier by tier — so you can prep to the pattern.

Typical weightage: Games & Tournaments contributes an estimated 6-9 of DILR's 66 marks (about 2-3 of 22 questions)

Question style	Marks each	Typical count	What it tests
Round-robin	3	~1	Combinations-based match counting, including double round-robin
Knockout	3	~1	The n-1 match-count shortcut, including byes and seeding
Points tables	3	~1	Reconstructing wins/draws/losses and points under a stated scoring convention
Multi-stage tournaments	3	~0-1	Summing group-stage and knockout-stage match counts separately
Seeding	3	~0-1	How seeding keeps top players apart in early bracket rounds

Prep strategy

Day 1: round-robin, double round-robin and the individual-team-count cross-check.
Day 2: knockout formats, byes and seeding conventions.
Day 3: points-table reconstruction and multi-stage tournament total counts, then a timed mixed set.

Exam-hall strategy

Battle-tested tips from mentors and toppers for this topic under the sectional clock.

Compute the total match count for the described format before attempting any other question in the set.
Identify the exact scoring convention (3-1-0, 2-1-0, or other) from the question before reconstructing any points table.
For multi-stage tournaments, compute each stage's match count separately and add them at the end.
Use the each-team-plays-n-1-matches fact as a cross-check on any round-robin reconstruction.
Remember that byes and seeding change how a knockout unfolds but never change its total n-1 match count.

Beyond the exam

Where this skill shows up in the job you're competing for — and in life.

Sports league scheduling

Round-robin and knockout match-counting is exactly how real sports leagues and tournaments plan fixture lists and broadcast schedules.

Elimination-based selection processes

The n-1 knockout principle applies to any single-elimination selection process, from sports brackets to elimination-round competitions.

Where else this topic is tested

Prepare once, score in every exam that asks it.

XAT Decision Making & QA-DIModerate — occasional tournament-format caselets

IBPS PO / SBI PO Puzzles & SeatingLow — games and tournaments are a CAT/XAT-specific DILR sub-type, rarely tested in banking exams

GATE / engineering entranceLow — this specific format is largely absent

📝 My notes

Saved on this device — sign in to sync · how this works

0/600

Questions aspirants ask

Pulled from the Q&A community and mentor sessions.

Roughly 2-3 of DILR's 22 questions, usually as one dedicated set describing a specific tournament format. It is the smallest DILR sub-topic by question count, but its match-counting shortcuts are quick, reliable marks once learned.

No — the total is always exactly n-1, since every match eliminates precisely one team and reaching a single champion from n teams requires eliminating n-1 of them, regardless of how the bracket or byes are arranged.

Identify the scoring convention (always stated explicitly, commonly 3-1-0 or 2-1-0), then use matches played = wins + draws + losses to find any missing count, and points = wins × win-value + draws × draw-value to compute the total.

The two stages use fundamentally different systems — round-robin group matches can end in a draw and award points, while knockout matches always have a single winner and immediately eliminate the loser. These are different currencies and must be tracked separately, not summed into one figure.

Confirm the total number of draws recorded across all teams' individual counts is even (since each drawn match is recorded once for each of its two participants), and cross-check the total match count using both C(n,2) and the sum of each team's individual matches played, halved.

More Data Interpretation & Logical Reasoning chapters

Data InterpretationReading a table or chart correctly is the whole skill — the arithmetic underneath (percent…

Logical ReasoningSeating arrangements, blood relations, directions and set overlaps all reward the same dis…

Caselets & Data SufficiencyA caselet is Data Interpretation with the table hidden inside prose — extract it before co…

Take the next step

CAT Data Interpretation & Logical Reasoning — find a tutor

Pair self-study with a tutor, a live course or a coaching centre.

1-on-1 help

🧑‍🏫

Find a verified tutor

School, college and competitive — online or at home.

Find tutors

Live cohorts

Join a live course

Test series and recorded lessons from top creators.

Browse courses

Classroom

Browse coaching centres

Verified institutes near you for every exam.

Find centres

Games & Tournaments

By the end of this chapter you'll be able to…

Before you start — revise these

Games & Tournaments — CAT DILR

1. Round-robin format

2. Knockout format

3. Points tables

4. Multi-stage tournaments

Worked Examples

Summary

Key formulas & results

Traps CAT sets — and how to dodge them

Exam-pattern practice

Are you exam-ready for Games & Tournaments?

5-minute revision

CAT question blueprint

Exam-hall strategy

Beyond the exam