SHL Deductive Reasoning Interactive: the complete 2026 guide

By Pratham Ranjan·15 min read·

The SHL Deductive Reasoning Interactive test is a constraint satisfaction test. You are not selecting a conclusion from four options — you are building a complete answer by dragging items into positions that satisfy every rule simultaneously. The logic required is the same across all question types; only the visual layout changes. If you are not sure which format you have, check which SHL test you are taking first. For the multiple-choice version, see the SHL Deductive Reasoning Test guide.

TL;DRthe 30-second version
  • 10 questions, ~18 minutes — roughly 100 seconds per question. Hard questions genuinely need 80–90 seconds of efficient work.
  • Every question is a constraint satisfaction problem (CSP): assign items to containers so all rules are satisfied simultaneously.
  • 4-step framework on every question: Lock → Chain → Eliminate → Verify.
  • IF-THEN rules are only active when the IF part is true — if the condition is false, the rule does not apply at all.
  • Ten question types: Room Assignment, Linear Seating, Task Scheduling, Team Formation, Resource Allocation, Circular Seating, Conditional Scheduling, Grid Placement, Ranking, Multi-Round Selection.
Definition
SHL Verify Interactive Deductive is a build-the-answer assessment where you solve constraint satisfaction problems by dragging items into valid positions. Every question gives you a set of items, a set of containers, and a set of rules — your job is to find the unique assignment that satisfies all rules simultaneously.
Not the format you have?
If your invitation shows statement-and-conclusion questions where you select "must be true / cannot be true / may be true", see the SHL Deductive Reasoning Test guide instead. The MCQ version tests similar logic but through a different task type.

SHL runs three interactive tests — deductive, numerical, and inductive — each with a completely different task type. If you are facing multiple tests, the other two guides are: SHL Numerical Reasoning Interactive (build-the-answer: rank, classify, plot) and SHL Inductive Reasoning Interactive (node sequences and fill-in shapes).

What makes the interactive format different

On the MCQ deductive test, you are given a pre-built scenario and asked which of four conclusions follows. On the interactive version, you build the scenario yourself. There is no answer list to eliminate from — if you place an item in the wrong position, nothing stops you from submitting it.

This creates two specific risks that do not exist on MCQ:

  • Cascade errors: one wrong placement can be perfectly consistent with some constraints while violating others you have not checked yet. You will not notice until you verify at the end — or until you submit.
  • Constraint forgetting: with 4–6 rules active simultaneously, it is easy to satisfy rules 1–4 and forget rule 5 exists. A structured approach (the 4-step framework below) is the only reliable counter.

The 4-step framework

Forge’s analysis of 100+ SHL deductive interactive questions confirms that every question type, at every difficulty level, is solved by the same four steps in the same order. Candidates who follow this on every question are significantly faster and more accurate than those who approach each question ad hoc. The same rule-first discipline connects all three SHL interactive tests — in the numerical interactive it is the qualifier word; in the inductive interactive it is the label decomposition method.

Step 1 — LOCK: find fixed constraints
Scan all constraints for any rule that forces an item into exactly one position: "must be in Room B", "is assigned to Period 1", "must be ranked 3rd". Place those items first, before anything else. They cost you nothing — there is only one valid choice — and they anchor everything that follows.
Step 2 — CHAIN: build dependency groups
Look for rules that link items together: "A and B must be together", "A must come before B", "if A is selected, B must also be selected". These constraints do not fix individual positions, but they do constrain groups. Treating a required pair as a single unit immediately reduces the problem size.
Step 3 — ELIMINATE: use placements to rule out positions
Every item you place removes options for remaining items. After locking your fixed items and placing your chain groups, ask: what positions are now impossible for the remaining items? Elimination often makes the remaining choices obvious without further analysis.
Step 4 — VERIFY: check every constraint before submitting
After placing all items, check each rule once in sequence. Do not rely on memory — read each constraint from the list and confirm it is satisfied in your current placement. Under 100 seconds of pressure, candidates who skip verification submit wrong answers they could have caught in 5 seconds.

The ten question types

Room Assignment (easiest)

Assign a small number of items (teams, groups) to a small number of rooms with capacity limits. Usually has one fixed assignment, one required-pair constraint, and one separation constraint. The fixed assignment is always your first move.

Average trained solve time: 15–20 seconds. If you are spending more than 40 seconds, you have not found the fixed anchor yet.

Linear Seating

Assign people to numbered seats in a row. Constraints include position restrictions (must be in seat 1 or 6), even/odd seat requirements, required adjacency pairs, and forbidden adjacency pairs. Lock the positional constraints first, place adjacency pairs next, then check the forbidden adjacency at the end.

Check the forbidden adjacency last
The most common error on linear seating: satisfying all other constraints, placing the final person, and only then realising two people who cannot be adjacent ended up next to each other. Run the forbidden-adjacency check explicitly after every placement, not just at the end.

Task Scheduling

Assign tasks to days of a week. Usually has one task pinned to a fixed day (your anchor), precedence chains (T1 before T3, T2 before T4), and one mutual exclusion. Lock the fixed day first — it splits the week into before and after, which determines where the precedence chains must sit.

Team Formation (hardest linear type)

Partition a group of people into 3 equal teams while satisfying fixed assignments, required pairs, and separation constraints. The key insight: treat required pairs as single units. A pair of 2 who must be together needs exactly one extra teammate — that narrows the options dramatically.

Team Formation approach
9 people into 3 teams of 3. E → Team 1 (fixed). {A,B} must be together. {H,I} must be together. C≠D (different teams). F≠G (different teams).

Lock E to Team 1.

Treat {A,B} and {H,I} as units. Each unit needs one more person to fill a team of 3.

Try: {A,B} → Team 2, {H,I} → Team 3. Team 1 gets E + 2 from {C,D,F,G}.

Try C and F for Team 1: {E,C,F}. Then G must avoid F (different teams) → G goes to Team 2: {A,B,G}. Then D goes to Team 3: {D,H,I}.

Check: C≠D ✓ (C=T1, D=T3). F≠G ✓ (F=T1, G=T2). All constraints satisfied.

Resource Allocation

Assign projects or tasks to managers or buckets with capacity limits. Has a fixed assignment, a separation constraint (two items cannot share a manager), and a minimum requirement. Lock the fixed assignment first. The separation constraint almost always resolves the remaining allocation without needing to try multiple options.

Circular Seating

Seat people around a circular table. Constraints involve opposite pairs, clockwise distance, and adjacency. The critical insight for a 6-seat circle: opposite seats are exactly 3 apart. The three opposite pairs are always (1,4), (2,5), (3,6). A constraint saying "2 people between D and F clockwise" means F is at position D+3 — making them opposite.

Opposite = 3 seats apart in a 6-seat circle
This equivalence is never stated in the question. Candidates who do not know it waste 30–40 seconds trying to enumerate circular arrangements manually. Memorise it before the test.

Conditional Scheduling (IF-THEN)

Assign items to time slots (periods, days) while satisfying conditional rules: "IF Math is in Period 1, THEN Physics must be in Period 2." The key skill is correctly handling the case when the IF condition is false.

Vacuous truth: the most important concept on this question type
If the IF condition is false in your assignment, the rule does not apply at all. You do not need to satisfy the THEN part. Many candidates try to satisfy both parts regardless — this is wrong and leads to over-constrained solutions that have no valid assignment.
IF-THEN example
5 courses to 5 periods. Rule 1: IF Math in Period 1 → Physics in Period 2. Rule 4: IF Physics NOT in Period 2 → Chemistry in Period 3. Biology before English. Chemistry ≠ Period 5.

Try Math = Period 1. Rule 1 fires → Physics = Period 2. ✓

Rule 4: IF condition is "Physics NOT in Period 2" — this is false (Physics IS in Period 2). So Rule 4 does not apply. Chemistry is free.

Remaining: Chemistry, Biology, English in Periods 3, 4, 5. Chemistry ≠ 5. Biology before English. Try Biology=3, Chemistry=4, English=5. All constraints satisfied. ✓

Grid Placement

Place items into a 3×3 grid where some cells must stay empty. Constraints include corner requirements, row requirements, horizontal/vertical adjacency, and forbidden adjacency. The key rule: diagonal cells are NOT adjacent. Only horizontal (same row, adjacent column) and vertical (same column, adjacent row) count as adjacent.

Candidate Ranking

Rank a set of candidates from 1st to last given two fixed positions and a chain of relative ordering constraints (A before B, B before C, C before D). Lock the fixed positions first — they are independent of the chain. Then slot the chained candidates into the remaining positions in order.

Multi-Round Selection (hardest)

Select exactly N items from a larger pool while satisfying conditional inclusion rules, exclusion pairs, and minimum-from-group requirements. The governing insight: some conditional rules are expensive — selecting item A forces you to also select B, consuming two of your N slots. Identify and avoid expensive triggers unless they are forced.

Multi-Round Selection approach
Select exactly 3 from {A,B,C,D,E,F,G}. IF A selected → B must be selected. C and D cannot both be selected. At least one of {E,F} must be selected. IF G selected → D cannot be selected.

Rule 1 (A→B) is expensive: selecting A spends 2 of 3 slots immediately. Avoid A unless forced.

Try G: this blocks D (Rule 4). Good — removes D from consideration, simplifying C≠D.

Must include E or F. Pick E. One slot left: pick B.

Final selection: {B, E, G}. Check: A not selected → Rule 1 vacuously true ✓. C and D not selected ✓. E selected ✓. G selected, D not selected ✓. Exactly 3 ✓.

Practise all 10 question types on forge

Forge's interactive deductive bank has all question types difficulty-weighted, with constraint-by-constraint worked solutions.

Start free practice

Timing and pacing

100 seconds per question is the effective budget. Trained candidates solve easy types (Room Assignment, Resource Allocation, Ranking) in 20–30 seconds, building a buffer for hard types (Team Formation, Circular Seating, Multi-Round Selection) that genuinely need 80–90 seconds.

Question typeTarget timeKey bottleneck
Room Assignment15–25sFinding the fixed anchor
Linear Seating40–60sForbidden adjacency check at the end
Task Scheduling20–35sBuilding the precedence chain around the fixed pivot
Team Formation60–90sTreating pairs as units; avoiding individual placement
Resource Allocation25–40sMinimum requirement check after separation is placed
Circular Seating60–90sConverting "2 between" into opposite-seat equivalence
Conditional Scheduling50–80sCorrectly identifying when IF condition is false
Grid Placement50–70sTracking which cells are empty vs diagonal-only
Candidate Ranking30–50sSeparating fixed positions from the relative chain
Multi-Round Selection60–90sIdentifying expensive triggers to avoid

The five cross-question patterns

  • Always lock fixed constraints first. Questions with at least one item forced into exactly one position give you a free placement. Never start placing unconstrained items before the fixed ones are down.
  • Treat required pairs as single units. When two items must be together, they move as one. This shrinks the problem from N items to N−1 units.
  • IF-THEN rules are not always active. If the IF condition is false, the rule is silent. Do not try to satisfy the THEN part when the IF is not triggered.
  • Avoid expensive selection triggers. On Multi-Round Selection questions, any rule that forces you to select an additional item on top of the one you chose is expensive. Avoid those items unless the constraints force you to include them.
  • Verify every constraint before submitting. Five seconds of checking saves you from submitting an answer that violates one constraint you forgot.

Related SHL guides

Frequently asked questions

What is the SHL Deductive Reasoning Interactive test?+

SHL Verify Interactive Deductive is a build-the-answer test where you solve constraint satisfaction problems by dragging items into positions — rather than clicking a multiple-choice answer.

How is it different from standard MCQ deductive?+

The interactive version asks you to build the complete answer: drag items into positions, assign people to teams, schedule tasks into days. The MCQ version asks you to select which conclusion must be true from four options.

What is the 4-step framework?+

Lock: place fixed-assignment items first. Chain: identify and treat required pairs as units. Eliminate: use your placements to rule out invalid positions for remaining items. Verify: check every constraint before submitting.

What is vacuous truth?+

If an IF-THEN rule's condition is false, the rule does not apply at all. You do not need to satisfy the THEN part. Many candidates incorrectly try to satisfy both parts regardless of whether the IF condition holds.

How do I solve circular seating?+

In a 6-seat circle, opposite seats are exactly 3 apart. The three opposite pairs are (1,4), (2,5), (3,6). A constraint saying '2 people between D and F clockwise' means D and F are opposite. Memorise this before the test.

How long is the test?+

Approximately 18 minutes for 10 questions — roughly 100 seconds per question. Easy question types can be solved in 20–30 seconds, building time for hard types that need 80–90 seconds.

Ready to practise?

Forge's deductive interactive bank has all 10 question types with step-by-step constraint walkthrough solutions. Free to start.

Sign up free