CAT Reasoning Questions: The 3 Constraint Grid Method
A CAT DILR set names seven employees and asks which four should form a committee, given five conditions about who can and cannot serve together. An aspirant tries one combination, finds it breaks the fourth condition, tries another, breaks the second, and by the time a valid group appears, six minutes are gone on a single question inside a larger set.
Among CAT reasoning questions, selection puzzles feel like trial and error because most aspirants solve them that way. Read the conditions in the right order instead, and a set that looks like blind guessing becomes a fast, almost mechanical elimination exercise.
Curious how much time selection sets are actually costing you right now? Go practice CAT Selection questions and time yourself on a full set before reading further.
- Selection puzzles in CAT DILR reward sorting conditions by strength before you test a single combination.
- The 3 Constraint Grid separates conditions into forced inclusions, forced exclusions, and conditional pairs, applied in that exact order.
- Guessing a full group first and checking it against every condition afterward is the slowest possible approach.
- A simple grid of candidates against conditions resolves most selection sets faster than narrative trial and error.
- Team formation and committee logic questions reward this structure specifically, more than most other CAT DILR question types.
Why Selection Puzzles Invite Guessing
Selection sets present a deceptively simple looking question, pick a valid subset from a larger group, which makes guess and check feel like a reasonable strategy. It is not. As the number of candidates grows, the number of possible subsets grows fast enough that even a handful of wrong guesses burns most of your available time on a single question.
The actual fast path is not smarter guessing. It is reading every condition once, sorting them by how much they narrow the field, and applying the strongest ones first so the guessing space shrinks before you ever test a full combination.
This is a genuinely different skill from the pattern recognition that works well on arrangement sets, where a fixed number of seats or slots naturally bounds the problem. A selection question can look deceptively open ended, with dozens of theoretically possible subsets, right up until the first forced condition is applied and the real number of live possibilities collapses. Recognising that the field always collapses fast once conditions are sorted correctly is what keeps the size of a selection set from feeling more intimidating than it actually is.
Mentors reviewing DILR scripts notice that aspirants who solve selection sets fastest often write almost nothing resembling a full combination until their second or third line of working. Everything before that is condition sorting, not guessing.
The 3 Constraint Grid
Sort every condition into one of three categories before you test anything, then apply them in this order.
Category 1: Forced Inclusions
Any condition that states a candidate must be included, directly or through a chain of other conditions, goes here first. "If A is selected, B must be too" combined with a separate condition that forces A in makes B forced as well. Apply these before anything else, since they lock part of the answer immediately.
Category 2: Forced Exclusions
Conditions ruling a candidate out entirely, or ruling them out once a Category 1 inclusion is applied, come next. "C and D cannot both be selected" combined with D being forced in from Category 1 means C is now excluded, without any guessing required.
Category 3: Conditional Pairs
What remains after Categories 1 and 2 are applied is usually a small set of conditional relationships between the few candidates still undecided. Only now, with the field already narrowed, does testing a small number of remaining combinations become fast rather than expensive. In most real sets, this final category resolves in one or two attempts rather than the dozen a blind guess and check approach would otherwise require.
A Grid Beats a Narrative Every Time
Once you have sorted conditions into the three categories, build a simple grid rather than reasoning in sentences. List every candidate down the side and mark each one included, excluded, or undecided as you apply each category. This grid does the same job the network table did for route puzzles: it turns a wordy set of conditions into a visual state you can scan in seconds.
| Category | What it tells you | When to apply it |
|---|---|---|
| Forced inclusions | Which candidates are locked in before any testing | First, always |
| Forced exclusions | Which candidates are ruled out, directly or by consequence | Second, right after inclusions |
| Conditional pairs | The remaining small set of live combinations | Last, once the field is already narrow |
Before testing your first full combination, count how many candidates are still undecided after Categories 1 and 2. If that number is three or fewer, Category 3 usually resolves in under a minute. If it is still five or six, you likely missed a forced consequence hiding in the earlier conditions.
How Selection Sets Differ From Arrangement Sets
It is worth being precise about what makes selection puzzles a distinct skill rather than a variant of the arrangement sets that also appear in CAT DILR. Arrangement sets, seating people in a row or around a table, ask where each entity goes. Selection sets ask a binary question instead, in or out, for each candidate, which changes what a useful representation looks like.
A grid built for an arrangement set tracks positions. A grid built for a selection set tracks status, included, excluded, or undecided, against each candidate. Using an arrangement style grid on a selection set, trying to track an ordering that the question never actually asks for, is a common source of wasted time, because it answers a question the set never posed while leaving the real inclusion and exclusion logic untracked.
This distinction matters most in mixed sets, increasingly common on recent CAT papers, where a single set combines an arrangement condition with a selection condition, for instance seating four selected committee members in a specific order once they are chosen. Recognising which part of the set is selection and which part is arrangement, and applying the right framework to each half separately, prevents the two logics from getting tangled into one another. Solve the selection half completely first, lock in exactly who is included, and only then move to arranging those chosen candidates, rather than trying to juggle inclusion and ordering decisions in the same pass.
A Worked Example: The Committee of Four
Return to the seven employee committee example. Suppose one condition states that if the finance lead is on the committee, the ops lead must be too, and a separate condition states the finance lead is required whenever the budget review is on the agenda, which the set confirms it is. Category 1 immediately forces both the finance lead and the ops lead onto the committee.
A third condition states the ops lead and the marketing lead cannot serve together. Category 2 now excludes the marketing lead entirely, since the ops lead is already forced in. With two seats locked and one candidate excluded, only the remaining candidates are left to fill the final two seats, and whatever conditional pairing conditions remain apply to a field of perhaps three or four people rather than the original seven. What looked like a five condition puzzle collapses into a one minute decision once forced consequences are applied in order.
Compare that to the guess and check approach from the opening of this piece. An aspirant testing full committees at random would need to check each candidate combination against all five conditions individually, discovering the same forced inclusions and exclusions the slow way, one failed attempt at a time, instead of deriving them directly from the conditions before ever naming a full group.
- Read every condition once before testing any combination.
- Sort conditions into forced inclusions, forced exclusions, and conditional pairs.
- Apply forced inclusions first, then trace their consequences into forced exclusions.
- Only test remaining conditional pairs once the field is already narrowed.
- Build a simple grid rather than reasoning purely in sentences.
Where This Breaks Down
Two mistakes undo the method even for aspirants who know the three categories.
Missing a Chained Consequence
The committee example above only collapses quickly because the ops lead being forced in was traced through to excluding the marketing lead. Stopping after the first forced inclusion, without checking what it forces in turn, leaves you solving a bigger field than necessary.
Testing Combinations Before Sorting Conditions
This is the original guess and check habit in disguise. Even a partial sort skipped in favour of an early guess reintroduces the same wasted attempts the method exists to remove. Under time pressure it is tempting to test the first combination that comes to mind, reasoning that a wrong guess still teaches you something. It does, but it teaches you slower than a proper sort would have, and CAT DILR time budgets rarely forgive that difference across a full section.
- Do you sort every condition into inclusion, exclusion, or conditional before testing anything?
- Do you trace a forced inclusion through to its consequences before moving on?
- Do you build a simple grid rather than reasoning purely in sentences?
- Have you deliberately timed a selection set recently, separate from other DILR set types?
This structure only becomes fast through repetition on real sets. Go practice Selection questions for CAT preparation and apply the three category sort deliberately, timing how quickly the field narrows on each new set.
Selection and team formation sets are one part of a broader DILR skill set. Our CAT DILR practice question bank covers all 15 chapters, so the same forced consequence habit built here transfers to arrangement and network sets too.
For a sense of how selection puzzles have actually appeared on real papers, our CAT exam previous year DILR questions with solutions show the exact style and difficulty CAT has used across recent slots. If you are still deciding how much weekly time DILR deserves relative to Quant and VARC, our CAT preparation strategy review is a quick way to sanity check the split before committing to a new schedule.
Build a Focused Selection Practice Plan
Optima Learn's topic priority system flags exactly which DILR set types are costing you the most time, so your practice hours go toward selection and grouping puzzles specifically instead of a random mix across every set type.
Build My Selection Set PlanFrequently Asked Questions About CAT Reasoning Questions
How common are selection and team formation sets in CAT DILR?
They appear regularly across CAT DILR slots, usually built around forming a committee, team, or group from a larger pool of candidates under several stated conditions.
What is the fastest way to start a selection puzzle?
Sort every condition into forced inclusion, forced exclusion, or conditional pair before testing any combination. Guessing a full group first and checking it against conditions afterward is the slowest reliable method.
Why do I keep missing forced consequences in these sets?
Most misses happen because a forced inclusion is applied once but not traced through to what it excludes in turn. Always ask what else a forced inclusion rules out before moving to the next condition.
Should I use a grid or just reason through the conditions in my head?
A simple grid, candidates down the side, included or excluded marked as you go, is faster to scan and less error prone than holding the whole state in your head, especially once four or more conditions are involved. Once a set passes three or four candidates with overlapping conditions, mental tracking alone becomes unreliable enough that the few seconds spent drawing a grid pay for themselves well before you reach the final answer.
Practice DILR sets, chapter by chapter
CAT DILR practice across LR puzzles and DI sets, each with a worked solution.
More from DILR
Continue reading
TITA Questions in CAT Quant: Does Your Approach Change?
A Real CAT Preparation Strategy: 2 Notebook System
Reading Comprehension Practice for CAT: Abstract Passages
How the CAT Normalization Process Works Across Slots
Put it into practice