Double Line-Up and Categorisation Puzzles

Double line-up (matrix) puzzles attach MULTIPLE variables to each person — e.g., name + city + profession + age. The fastest tool is a GRID: rows = people/positions, columns = variables. Fill only DEFINITE clues first; mark eliminations with a cross in the cell. Negative clues ('X is not from Delhi') are gold — they shrink the grid without needing positive placement. Speed rule: process clues in order of certainty (fixed > comparative > negative). Memory aid: 'Definite, Difference, Deny' — place definites, then comparatives, then use denials to mop up. Never carry a variable in your head; always commit it to the grid cell immediately to avoid re-derivation.

Categorisation puzzles often hide a RANKING (tallest/oldest/highest-paid). Convert words to a single ordered line: use '>' for 'taller/older/more than'. 'A is taller than B but shorter than C' becomes C > A > B. 'Only two people are older than D' means D is 3rd from the oldest. Speed trick: anchor the chain at 'only N are above/below' clues — they pin exact ranks. Watch units: salary in thousands vs lakhs, age in years. For 'second highest' type final questions, count from the correct end. Memory hook: translate EVERY comparison into one master inequality chain before answering — mixing two chains causes most errors.

Double line-up puzzles look intimidating because they hand you three or four columns of attributes at once — people, cities, sports, sometimes ages or floors — and ask you to nail down every cell. But the trick is not to solve the whole grid in your head. The trick is to follow each clue's "if-then" link both ways through the grid, letting one elimination chain into the next. This worked example shows you exactly how the bidirectional chain works in an SBI PO Mains-style matrix puzzle.

Definition: A double line-up puzzle is a logic problem where each of N people has exactly one value from each of two (or more) attribute categories. You are given clues linking attributes across categories and must produce the unique full assignment.

Definition: A bidirectional clue is a statement linking two categories — for example, "the person who likes Mumbai plays Tennis" — which lets you propagate information both from city to sport AND from sport back to city.

Setting up the problem

We have five people — A, B, C, D, E — each liking one city and playing one sport. We will not enumerate cities and sports beyond what the clues touch (Mumbai and Tennis on the matched side, Cricket on B's side), but in a real paper you would have five of each. The clues are:

C1. The one who likes Mumbai plays Tennis.
C2. A does not like Mumbai.
C3. B plays Cricket.
C4. The Tennis player is not B or C.

Draw a grid in your rough sheet — Person (rows) × City (cols) and Person × Sport. Most candidates draw both grids side by side, but the cleanest approach is one combined grid with two columns per person, one for city and one for sport.

Step-by-step propagation

Step 1: Mark the Mumbai ↔ Tennis link. From C1, whoever lives in Mumbai plays Tennis. Conversely, whoever plays Tennis lives in Mumbai. Write a small "M ⇔ T" tag in your scratch space. This is the bidirectional axle around which the whole puzzle rotates.

Step 2: B plays Cricket (C3). Since B plays Cricket, B does not play Tennis. Using C1's bidirectional link, B does not like Mumbai either. Two facts in one clue — that is the payoff of bidirectional propagation.

Step 3: C does not play Tennis (C4). By the same bidirectional link, C does not like Mumbai.

Step 4: A does not like Mumbai (C2). Again, by the link, A does not play Tennis. (You did not need a separate clue to tell you this — the bidirectional axle did the work for you.)

Step 5: So Tennis is played by neither A, nor B, nor C. That leaves D or E as the Tennis player, and therefore the Mumbai-lover.

Step 6: At this point you would consult any remaining clues to pin down which of D or E it is. In the original fragment we are told to "cross-eliminate until one survives". Typically a clue like "E does not like Mumbai" or "D plays Cricket on weekends" would settle it. If E is eliminated, D is the Tennis-playing Mumbai-lover; if D is eliminated, E takes that slot.

The key insight is that ONE clue (C1) ended up eliminating three candidates — A, B and C — for two columns at once, by acting on every fresh fact about who plays Tennis or who likes Mumbai.

Why it matters

In SBI PO Mains, 4–5 of the reasoning questions in a single set hang on one tightly chained puzzle. If you handle each clue as a one-direction fact ("B plays Cricket — okay, write it down"), you may need to revisit the same clue four times. If you propagate bidirectional links the moment you see them, you collapse the puzzle in three passes. That difference is the difference between attempting the set in 4 minutes and abandoning it after 8.

Real-world example

A bank manager planning the day's customer assignments faces the same logic: each relationship manager owns one product line, sits at one workstation, and meets one assigned customer segment. Constraints come in as "the RM handling MSME loans must sit nearest the printer" (a bidirectional link between product and workstation) or "no Wealth RM meets Gen-Z customers" (a one-way negative). The same matrix discipline used in SBI PO is exactly what the manager uses on a whiteboard before opening hours.

Common misconception

The biggest trap is treating "A does not like Mumbai" as only about A and Mumbai. Because of C1 (M ⇔ T), it is also a statement that "A does not play Tennis". Candidates who miss this hidden link spend extra time later trying to figure out why their Tennis column has too many candidates. The remedy is to annotate every if-then clue with its converse the moment you read it.

A second misconception is to start the grid by filling positive cells. With limited clues, you almost always have more negatives than positives at first. Mark the negatives ("X" in the grid cell) aggressively — the lone surviving cell in a row or column eventually forces a positive assignment.

Worked example — full chain in one go

Question: From the clues above, who is the Tennis-playing Mumbai-lover, assuming a final clue "E plays Football"?

Solution:
Step 1: From C1, Mumbai ⇔ Tennis. From C2, A ≠ Mumbai, so A ≠ Tennis. From C4, B ≠ Tennis and C ≠ Tennis, so B ≠ Mumbai and C ≠ Mumbai. From C3, B = Cricket (consistent).
Step 2: Tennis player is in {D, E}. New clue: E = Football, so E ≠ Tennis.
Step 3: Therefore D plays Tennis, and by the bidirectional link, D likes Mumbai.
Conclusion: D is the Tennis-playing Mumbai-lover.

Notice how every elimination came from a clue and its converse working together — a single clue did the work of two.

Double line-up (matching each person to 2–3 attributes) and categorisation/scheduling puzzles are the multi-variable sets SBI PO uses to separate the cut-off crowd from top scorers. Expect one set in Prelims and one or two in Mains — often the longest, most time-hungry set of the paper. They reward tabulation and punish anyone holding data in their head.

Two families

• Double line-up / categorisation: each person carries 2–3 tags (person + city + fruit + colour). Order may not matter — use a grid.
• Scheduling: items placed across days/dates/months/slots. Order matters — use a timeline.

Clue phrase	Handling
"the one who likes P also lives in Q"	link two attribute columns
"neither X nor Y"	eliminate two options from that cell
"between Monday and Thursday"	strictly Tue/Wed (endpoints excluded)
"day before/after"	adjacent timeline slots (not immediate unless "just")

Method

Draw a table: rows = persons/slots, columns = attributes. Enter definite links first; maintain a negative (✗) grid for every "not/neither". Chain conditional links to collapse options. For date sets spanning months, pre-note days per month.

Exam Tricks & Tips

• 🎯 Keep a negative-information grid: three ✗ in a row of four forces the fourth cell — SBI hides answers behind exactly this.
• 🎯 Lock conditional pairs: "the person from Pune likes tea" becomes a bound column-pair, so any Pune clue also fixes tea.
• 🎯 "Between Monday and Friday" excludes both endpoints (Tue/Wed/Thu only); the exclusive reading is the trap.
• 🎯 Pre-note month lengths (Feb 28/29, 30-day months) before any cross-month date clue.
• 🎯 When order is irrelevant (pure categorisation), stop sequencing — just fill the truth grid.
• 🎯 For long Mains sets, solve the most-constrained attribute first; it cascades fastest.
• ❌ Common mistake: reading "before/after" as immediately before/after — it isn't unless "just/immediately" is stated.

Expected exam pattern

7 persons × 7 days (or 4 months × 2 dates) with 1–2 extra attributes. 5 questions on exact slot, attribute matching, odd-one-out. Mains sets are long and multi-layered.

Quick recap

Tabulate, run a ✗ grid, bind conditional pairs, respect exclusive "between", pre-note month lengths, and never read plain "before/after" as immediate.

Cover the answer, recall, then check. 11 cards on double line-up & categorisation for SBI PO.

Q1. "P is scheduled between Monday and Friday." Which days are possible?
A1. Tuesday, Wednesday, Thursday — "between" excludes both endpoints.

Q2. What is a negative-information grid and why use it?
A2. A ✗ table for every "not/neither" clue; when a row has all-but-one ✗, the last cell is forced.

Q3. Does "A is scheduled before B" mean immediately before?
A3. No — only that A is earlier; use "just/immediately before" for adjacency.

Q4. When does order NOT matter?
A4. In pure categorisation (person + city + fruit with no sequence) — just fill the truth grid.

Q5. How do you handle "the one from Pune likes tea"?
A5. Bind Pune↔tea as a column-pair; any clue fixing one fixes the other.

Q6. Two events fall "on the same date of different months, one being March." Why note month lengths?
A6. Valid date-numbers depend on days per month (e.g. no 31st in April/June).

Q7. "Neither red nor blue" for item X removes what?
A7. Two colour options from X, narrowing the remaining choices.

Q8. Best structure to start a double-variable puzzle?
A8. A rows-by-columns table: one row per person/slot, one column per attribute.

Q9. "Exactly two days between A and B." Day-number difference?
A9. 3 (two full days sit between).

Q10. How do conditional "the one who … also …" clues help?
A10. They chain two attribute columns, collapsing many options into a linked pair.

Q11. Most common scheduling error?
A11. Reading plain "before/after" as adjacency and including the endpoints of "between".