Can You Predict Which DILR Set Will Be the Sitter?

DILR

Every candidate wants the same thing from a DILR section: to identify, within the first few minutes, which set is the easy one. The word used for it is the sitter, and the hope is that there is a tell, some visible property that marks it out before you have invested anything.

There is no such tell, and the reason is worth understanding rather than just accepting: a sitter is a set that is easy relative to a reader, so the property is not in the paper at all. What does exist is a reliable procedure for finding the cheapest set available to you in the first few minutes, which is a different and more useful thing. This piece explains why prediction fails and what to run instead.

Why the Sitter Cannot Be Predicted

The term describes a relationship rather than an object, and that is the whole problem.

A set is a sitter for a candidate who recognises its family, knows which structure it wants, and has run that structure enough times to execute it quickly. The same set is expensive for a candidate who has to work out the representation from scratch. Nothing about the set changed between those two readers.

The evidence for this is available to anyone after any exam. Ask twenty candidates which set was easiest and you will get several answers, each accurately describing that candidate's own paper. If easiness were a property of the set, they would agree.

The Proxies People Use, and Why They Fail

Each of these is used because it is visible in a second, which is exactly why they are tempting and exactly why they do not work. The properties that decide cost take a little longer to see.

The Length Proxy Is Actively Backwards

It is worth singling this one out, because it is the most used and the most wrong.

Solving means narrowing possibilities until one arrangement survives, and every condition does some of that narrowing. A set with many specific conditions has handed you many tools. A four line set has handed you few, so you hold several configurations at once and test each new condition against all of them.

That is why the long set is frequently the cheap one and the short set is frequently the trap. Candidates who skip long sets on sight routinely never read the easiest set in the section.

The Procedure That Replaces Prediction

What you can do is find the cheapest set available to you, quickly and deliberately. That is a search rather than a forecast.

Step	What you do	Budget
Sweep	Read every set, in order, without solving	Under a minute each
Per set, question one	Do I recognise the family and its structure?	Seconds
Per set, question two	Is any first placement forced by the conditions?	Seconds
Per set, question three	Do the questions ask for one structure or several?	Seconds
Rank and start	Cheapest set you are confident about, first	Immediately

The Sweep Is Behavioural, Not Analytical

The procedure is not complicated. Executing it is, and the difficulty is not intellectual.

Once you have read a set you can clearly do, it is almost physically difficult not to start it. The sweep collapses at the second set, and what you have then is not selection but acceptance of the first workable thing you met. Since there is no difficulty gradient, that is close to random.

This is why the sweep has to be rehearsed in mocks until it stops requiring a decision. Expect the sections where you install it to feel worse, because minutes are going into reading rather than solving and the return arrives later.

Start With the Cheapest, Not the Most Interesting

Once ranked, the order matters, and instinct points the wrong way here too.

Start with the cheapest set you are confident about rather than the one you find most interesting. The interesting set is frequently the expensive one, because what makes it interesting is usually that its structure is unusual, and unusual means no recognition to draw on and a cold start you will pay for.

Banking a cheap set early also does something useful to your state. You have marks, the section is tractable, and the decisions that follow are made by a candidate who is settled rather than one who is behind.

What Actually Makes a Set Cheap for You

Since cheapness is relative, it is worth naming what puts a set in your cheap category, because those are the things you can build.

Recognition of the family, which brings a default structure with it instead of requiring one to be invented. Fluency in the representation that family wants, so the grid or table goes down correctly the first time. And enough exposure that you know roughly what this kind of set costs you, which is what makes the estimate during the sweep meaningful rather than a guess.

All three are built by working type by type before mixing. The recurring families are stable enough to learn: arrangements, games and tournaments, distribution and selection, tables and caselets, networks, scheduling. Candidates who only ever do mixed practice build recognition slowly, because they never spend long enough inside one family for its shape to become familiar.

Widening the Category Is the Real Goal

This reframes what preparation is for in this section.

You are not learning to spot sitters. You are increasing the number of sets that are cheap for you, so that whatever the paper contains, more of it falls into your cheap category. A candidate with four familiar families has a decent chance that a section contains one; a candidate with all six recurring families has a much better one.

That is also why DILR improvement often arrives in steps rather than smoothly. Nothing changes for weeks and then a whole family moves from expensive to cheap at once, which shows up as a sudden jump.

What to Log So the Estimate Improves

The sweep produces a cost estimate per set, and an estimate is only worth having if it has been checked against reality often enough to be calibrated.

So log three things per set in every practice section: what you predicted it would cost, what it actually cost, and whether you attempted it. That third column matters more than it looks, because the sets you skipped are the ones you have no data on, and a systematic error in skipping is invisible without it.

After ten or fifteen sections you will be able to answer the questions that matter. Are your estimates roughly right, or consistently optimistic? Which families do you misjudge? Are there sets you keep skipping that, on review, would have been cheap? Most candidates find one specific family they systematically avoid and systematically could have done, and correcting that single habit changes the section more than any technique.

Some Sections Have No Cheap Set

Worth saying, because the procedure can promise more than it delivers.

Occasionally you sweep a section and nothing is cheap for you. That is a real outcome and the response is not to hunt harder. It is to take the least expensive option, accept a lower attempt count, and protect accuracy on what you do attempt, since a correct answer is plus three while an incorrect MCQ is minus one and an unattempted question is zero.

Sections like that are survivable and they are not evidence that the procedure failed. The sweep told you something true, which is that this paper is expensive for you, and knowing that early is worth more than discovering it at minute thirty.

The Summary

There is no way to predict which set will be the sitter, because a sitter is easy relative to a reader rather than easy in itself. Twenty candidates disagreeing about which set was easiest after the same exam is the evidence.

The proxies people use all fail, and the most common one fails backwards: short sets are frequently expensive because sparse constraints mean branching, while dense sets frequently lock down fast. Position carries no information since there is no difficulty gradient, and a familiar scenario or tidy presentation says nothing about structure.

Replace prediction with a search. Sweep every set under a hard budget, asking three questions of each: do I recognise the family, is a first placement forced, and do the questions want one structure or several. Rank by cost, start with the cheapest you are confident about rather than the most interesting, and spend your preparation widening the set of families that are cheap for you.

If your section starts with whichever set you could do first, you have not selected, you have accepted. A CAT preparation strategy review will show what that is costing across your mocks, and a personalised CAT preparation plan sequences the type-wise work that widens your cheap category.