What Is a Logical Puzzle?
A Logical Puzzle is a structured constraint-satisfaction challenge where a collection of entities (people, objects, teams), attributes (professions, cities, colors), and slots (positions, days, ranks) must be mutually mapped. The solver's task is to find an assignment that satisfies every verbal clue simultaneously, converting scattered constraints into a single coherent truth.
Deduction Over Guesswork
Logical puzzles are solved by systematic constraint propagation, never random trial and error. Every clue either locks a coordinate, eliminates possibilities, or establishes relative bounds. As confirmed deductions propagate across linked categories, the solution space collapses rapidly until the puzzle resolves like falling dominoes.
To master multi-clue puzzles, you must maintain crystal-clear separation between four distinct states of information:
Stated directly in a clue with zero interpretation required (e.g., "Amit is an Engineer"). Recorded immediately as an immutable anchor.
Direct AxiomFollows inexorably from the intersection of multiple clues (e.g., if Doctor is from Mumbai and Amit is in Kolkata, Amit cannot be the Doctor).
Forced TruthCompatible with current constraints, but not yet unique (e.g., "Rohan could be on floor 2 or 4"). Never write this as a confirmed fact!
Branch CandidateAn assignment that violates at least one explicit clue or structural rule. Encountering a contradiction instantly disproves a tentative branch.
Instant RejectionLogical puzzles test mental discipline, working-memory management, and multi-variable synthesis. They simulate complex corporate decision-making under interlocking constraints.
Dominates CAT LRDI (15-20% of section weightage), MAH MBA CET (15+ puzzle questions), SNAP, NMAT, and XAT decision-making sets.
Basic set relations, tabular notation, inequality chaining, and comfort with formal conditional logic ($P \implies Q$). No advanced mathematics required!
Every logical puzzle is assembled from three structural components and five distinct clue archetypes. Understanding these building blocks allows you to deconstruct complex story problems into mathematical constraint networks:
The Actors / Objects
The primary items being placed or assigned: people ($A, B, C$), teams ($T_1, T_2$), companies, or products.
The Properties
Characteristics possessed by entities: professions (Doctor, Lawyer), cities (Delhi, Mumbai), favorite colors, or car models.
The Framework
The fixed ordering system: seat positions ($1 \dots N$), building floors ($1 \dots 5$), days of the week (Mon $\dots$ Sat), or rank tiers.
| Clue Archetype | Verbal Formulation | Mathematical Constraint | Deductive Action |
|---|---|---|---|
| Positive Clue | "Bhavna is an Engineer." | $\text{Prof}(\text{Bhavna}) = \text{Engineer}$ | Lock cell with ✔; mark ✘ across Bhavna's row and Engineer's column. |
| Negative Clue | "Amit is not an Architect." | $\text{Prof}(\text{Amit}) \ne \text{Architect}$ | Mark ✘ in the intersection cell; reduce candidate pool for Amit. |
| Relative Clue | "B sits immediately right of E." | $\text{Pos}(B) = \text{Pos}(E) + 1$ | Form block $[E][B]$; slide block across available consecutive slots. |
| Conditional Clue | "If Dev is selected, Maya is not." | $\text{Dev} \implies \neg\text{Maya}$ | Contrapositive: $\text{Maya} \implies \neg\text{Dev}$. Both cannot be in team. |
| Combined Clue | "The Doctor lives in Mumbai and is not Divya." | $\text{City}(\text{Doctor}) = \text{Mumbai} \land \text{Divya} \ne \text{Doctor}$ | Simultaneously ties two categories and eliminates Divya from Mumbai. |
🧪 Mini-Demo: Converting Verbal Text to Structured Constraints
Verbal Narrative: "Three friends—Aman, Bina, and Chetan—each study a distinct subject (Math, Physics, Chemistry). Aman does not study Chemistry. The student studying Physics is older than Bina. Chetan studies Math."
The single most common cause of wasted exam time is choosing an inappropriate scratchwork representation. A problem solved in 2 minutes with a linear position strip can become an intractable mess if forced into a 2D cross-grid:
Best for row seating, queues, floors, or chronological schedules where adjacency and left/right matter.
Best for round tables. Fix an anchor at Seat 1 to remove rotational redundancy; track clockwise vs counter-clockwise.
Best when 4-6 entities must be matched one-to-one with professions, cities, or car brands. Enables tick/cross elimination.
Best for selecting $K$ items from $N$ candidates with quotas (e.g. 2 Economists + 2 Analysts) and compatibility rules.
Best for rankings, heights, weights, or marks. Chain inequalities ($A > B > C$) to identify bounding limits.
Maintain sets of unresolved options per slot. Erase candidates as negative clues eliminate possibilities.
💡 Decision Rule: When Does a 2D Table Become Unnecessarily Complex?
If a puzzle features an intrinsic natural sequence (such as 7 days of the week, 6 numbered floors, or 5 race finishing ranks), never draw a two-dimensional grid of Persons $\times$ Days. Instead, draw the fixed timeline as the backbone and place the entities into the day slots. Use cross-matching grids only when neither category has an inherent sequential order (e.g. matching 4 Friends $\times$ 4 Cars $\times$ 4 Cities).
Linear arrangement puzzles position entities in a straight row. Every deduction hinges on distinguishing exact directional offsets from general inequalities:
Adjacency vs. General Order
- Immediately to the left: $\text{Pos}(A) = \text{Pos}(B) - 1$. Form the unbreakable two-person block $[A][B]$.
- Somewhere to the left: $\text{Pos}(A) < \text{Pos}(B)$. Allows 0, 1, 2, or more people between them.
- Immediate neighbours: $|\text{Pos}(A) - \text{Pos}(B)| = 1$. The block can be $[A][B]$ OR $[B][A]$.
- $k$ people between $A$ and $B$: $|\text{Pos}(A) - \text{Pos}(B)| = k + 1$.
Facing Direction & End Constraints
- Facing North: Left is towards index 1; Right is towards index $N$.
- Facing South: Left is towards index $N$; Right is towards index 1 (reverse!).
- End-position clues: $A$ at an extreme end locks $\text{Pos}(A) \in \{1, N\}$. Always test these two branches first!
- Negative end clues: "F does not sit at an end" forces $\text{Pos}(F) \in \{2, \dots, N-1\}$.
Problem: 6 friends ($A, B, C, D, E, F$) sit in chairs $1 \dots 6$ from left to right. Clues: (1) $C$ is at an extreme end; (2) Exactly two people sit between $C$ and $E$; (3) $B$ sits immediately right of $E$; (4) $A$ sits immediately left of $D$; (5) $F$ is not at an extreme end.
Circular seating introduces modular cyclic arithmetic and rotational symmetry. Unlike linear rows, a circle has no ends:
1. The Anchor Rule
Because all $N$ positions in an empty circle are rotationally identical, always place your first person ($P$) at Seat 1. This eliminates $N$ duplicate rotations and converts the remaining seats into a fixed relative coordinate system.
2. Facing Inward vs. Outward
When facing the center: moving clockwise means moving to that person's left; counter-clockwise means moving to their right. When facing outward, the directions flip 180°.
3. Exact Opposites
An exact opposite seat exists if and only if $N$ is even. In an 8-person table, opposite of Seat $i$ is $(i + 4) \pmod 8$. In an odd table ($N=5, 7$), no person sits directly opposite another.
⚠️ Critical Fallacy: Rotational vs. Reflection Symmetry
While fixing an anchor removes rotational redundancy, you must never assume reflection (mirror) symmetry. As soon as a clue specifies "to the right" or "to the left", clockwise and counter-clockwise become distinct chiral orientations. Mirroring the arrangement will reverse all left/right clues and invalidate the solution!
Problem: 6 people ($P, Q, R, S, T, U$) sit around a circular table facing inward. Seats $1 \dots 6$ are arranged clockwise. Clues: (1) $P$ sits opposite $S$; (2) $Q$ sits second to the left of $P$; (3) $T$ sits immediately right of $P$; (4) $U$ is not an immediate neighbour of $Q$.
Grouping puzzles require selecting a subset of candidates from a larger pool subject to quota requirements, conditional inclusions, and mutual exclusivity:
Pairwise Relationship Laws
- Mutual Incompatibility ($A \land B = \emptyset$): "If $A$ is selected, $B$ cannot be selected." At most one of $\{A, B\}$ can be in the team. They can both be left out!
- Conjoint Selection ($A \iff B$): "$A$ and $B$ must both be selected or neither selected." They act as a fused binary unit of weight 2 or 0.
- Unidirectional Requirement ($A \implies B$): "$B$ must be selected if $A$ is selected." If $A$ is in, $B$ is in. But $B$ can be in without $A$!
Quota & Parity Constraints
- Sub-group Quotas: Fixed counts (e.g. exactly 2 Economists and 2 Analysts). Tracks category balance.
- At Least One ($\ge 1$): Disqualifies pure monolithic groups; requires $\text{Count} \ge 1$.
- Exactly One ($= 1$): Forces a single representative; picking one rejects all other candidates in that sub-category.
📋 The Binary Selection Ledger (IN vs. OUT)
Always maintain two explicit lists on your scratchpad: IN (Confirmed Members) and OUT (Eliminated Candidates). Every deduction must be immediately transferred to the ledger:
Matching puzzles assign entities across distinct categories (e.g. People $\times$ Professions $\times$ Cities). In a one-to-one problem, each entity possesses exactly one attribute from each category:
⚡ The Law of Cross-Elimination
In any one-to-one sub-matrix:
| Person | Profession Sub-Matrix | City Sub-Matrix | ||||||
|---|---|---|---|---|---|---|---|---|
| Candidate | Arch | Doc | Eng | Law | BLR | DEL | KOL | MUM |
| Amit | ✘ | ✘ | ✘ | ✔ | ✘ | ✘ | ✔ | ✘ |
| Bhavna | ✘ | ✘ | ✔ | ✘ | ✔ | ✘ | ✘ | ✘ |
| Chetan | ✔ | ✘ | ✘ | ✘ | ✘ | ✔ | ✘ | ✘ |
| Divya | ✘ | ✔ | ✘ | ✘ | ✘ | ✘ | ✘ | ✔ |
Scheduling problems map entities onto an ordered timeline (days of the week, hours of the day, or numeric ranks). The key technique is combining relative precedence inequalities to detect bounding contradictions:
Precedence Algebra
- Transitivity: If $A$ is scheduled before $B$ ($A < B$) and $B < C$, then $A < C$ is guaranteed.
- Exact Gap Constraint: "Exactly two days between English and Math" means $\text{Day}(\text{Math}) - \text{Day}(\text{English}) = 3$.
- Immediate Sequence: "Chemistry is immediately after Physics" means $\text{Day}(\text{Chem}) = \text{Day}(\text{Phy}) + 1$.
Detecting Cycle Contradictions
- If clues imply $A < B$, $B < C$, and an assumption requires $C < A$, a cyclic contradiction ($A < A$) is created.
- A cyclic inequality in a strict linear order is mathematically impossible, instantly disproving the tentative assumption!
Conditional clues dictate what must happen when a specific trigger condition is fulfilled. Flawless logical translation prevents catastrophic exam traps:
| Rule Type | Verbal Statement | Valid Deduction | Common Fallacy to AVOID |
|---|---|---|---|
| If-Then | "If Alpha gets 40L, Beta gets 20L." | $\alpha = 40 \implies \beta = 20$ Contrapositive: $\beta \ne 20 \implies \alpha \ne 40$ |
Converse fallacy: Assuming $\beta=20$ proves $\alpha=40$ (FALSE!). |
| If-Then-Not | "If Beta gets 20L, Delta cannot get 10L." | $\beta = 20 \implies \delta \ne 10$ Contrapositive: $\delta = 10 \implies \beta \ne 20$ |
Assuming $\delta \ne 10$ forces $\beta=20$ (FALSE!). |
| Exclusive OR | "Alpha gets either 10L or 40L." | $\alpha \in \{10, 40\}$ and $\alpha \ne 20, 30$ | Treating either/or as allowing both simultaneously when exclusive. |
Novice solvers ignore negative clues because they do not provide an immediate assignment. Master solvers know that a collection of negative clues is the most powerful weapon in logical reasoning:
Deduction Through Pure Exclusion
Consider a 5-floor building ($1 \dots 5$). Suppose no positive clue is given for $V$, but negative clues establish:
Notice that without a single positive statement about $V$'s whereabouts, $V$'s exact coordinate was locked with 100% mathematical certainty purely through negative pruning.
Follow this battle-tested 11-step execution algorithm on every multi-clue puzzle:
The highest-scoring CAT and XAT puzzles are hybrid multi-constraint sets combining two or more formats—such as a linear seating arrangement combined with multi-attribute matching and conditional scheduling.
Cross-Layer Information Transfer
In a hybrid puzzle, progress in Layer 1 (e.g. discovering that Bina sits at Desk 1) immediately triggers an attribute lock in Layer 2 (Bina's bag is Blue), which unlocks a relative block in Layer 3 (Red bag is immediately left of Yellow bag). Master solvers treat multiple diagrams as a single synchronized circuit.
Clues:
1. $C$ sits at one of the extreme ends.
2. Exactly two people sit between $C$ and $E$.
3. $B$ sits immediately to the right of $E$.
4. $A$ sits immediately to the left of $D$.
5. $F$ does not sit at an extreme end.
Who sits at Chair 1, and who sits second to the left of $C$?
- Clue 1 (Branching on Anchor): $C$ can sit at Chair 1 or Chair 6.
- Test Branch 1 ($C=1$): Two people between $C$ and $E \implies E$ is at Chair 4 ($|1 - 4| - 1 = 2$). Clue 3: $B$ is immediately right of $E \implies B$ is at Chair 5. Remaining chairs: $\{2, 3, 6\}$. Clue 4: $A$ is immediately left of $D \implies$ block $[A][D]$ must take Chairs 2 and 3 ($A=2, D=3$). The sole remaining chair for $F$ is Chair 6. But Clue 5 explicitly forbids $F$ from sitting at an extreme end! Contradiction $\implies$ Branch 1 is REJECTED.
- Test Branch 2 ($C=6$): Two people between $C$ and $E \implies E$ is at Chair 3 ($|6 - 3| - 1 = 2$). Clue 3: $B$ is immediately right of $E \implies B$ is at Chair 4. Remaining chairs: $\{1, 2, 5\}$. Clue 4: Block $[A][D]$ must take consecutive empty chairs $\{1, 2\}$, so $A=1, D=2$. The sole remaining chair for $F$ is Chair 5. Verify Clue 5: Chair 5 is NOT an end! All constraints hold!
Clues:
1. $P$ sits directly opposite $S$.
2. $Q$ sits second to the left of $P$.
3. $T$ sits immediately to the right of $P$.
4. $U$ is not an immediate neighbour of $Q$.
Find the complete seating order and state who sits immediately to the left of $S$.
- Fix Anchor: By rotational symmetry, fix $P$ at Seat 1.
- Clue 1: Seat opposite 1 in a 6-person circle is $1 + 6/2 = 4$. Thus $\text{Seat}(S) = 4$.
- Clue 2: Facing center, left is clockwise. 2nd left of Seat 1 is Seat 3 ($1 \to 2 \to 3$). Thus $\text{Seat}(Q) = 3$.
- Clue 3: Right is counter-clockwise. Immediately right of Seat 1 is Seat 6. Thus $\text{Seat}(T) = 6$.
- Clue 4 & Elimination: Unassigned seats are $\{2, 5\}$ for $\{R, U\}$. The immediate neighbours of $Q$ (Seat 3) are Seats 2 and 4. Since $U$ cannot be adjacent to $Q$, $U \ne 2$. Therefore, $\text{Seat}(U) = 5$, and by elimination, $\text{Seat}(R) = 2$.
Clues:
1. Exactly two Economists and two Analysts must be selected.
2. If $E_1$ is selected, $A_1$ cannot be selected.
3. $A_2$ and $A_3$ must either both be selected or neither selected.
4. If $E_2$ is selected, then $A_4$ must be selected.
5. $E_3$ cannot be selected unless $E_1$ is selected ($E_3 \implies E_1$).
Which 4 candidates form the task force?
- Analyze Analysts (Quota = 2 from $\{A_1, A_2, A_3, A_4\}$): Clue 3 dictates that $\{A_2, A_3\}$ are selected together or rejected together.
• Case A: $\{A_2, A_3\}$ are BOTH selected. This immediately fills the entire Analyst quota of 2! Consequently, $A_1$ and $A_4$ are both OUT.
• Case B: $\{A_2, A_3\}$ are NEITHER selected. Then the 2 Analysts must be $\{A_1, A_4\}$. - Evaluate Economists (Quota = 2 from $\{E_1, E_2, E_3\}$):
• By Clue 5 ($E_3 \implies E_1$): If $E_3$ is selected, $E_1$ must be selected. So Economists could be $\{E_1, E_3\}$.
• Could Economists be $\{E_2, E_3\}$? No, because $E_3$ requires $E_1$, which would make 3 Economists!
• Could Economists be $\{E_1, E_2\}$? If $E_2$ is in, Clue 4 forces $A_4$ to be in. But in Case A, $A_4$ is OUT! In Case B ($A_1, A_4$ in), $E_1$ is in, but Clue 2 forbids $E_1$ and $A_1$ together! Contradiction! - Forced Resolution: $E_2$ can NEVER be selected without contradiction. Therefore, the 2 Economists MUST be $\{E_1, E_3\}$.
Since $E_1$ is in, Clue 2 eliminates $A_1$. In Case B, $A_1$ was required, so Case B is REJECTED!
This forces Case A: The 2 Analysts MUST be $\{A_2, A_3\}$.
Clues:
1. The Doctor is from Mumbai.
2. Bhavna is an Engineer.
3. Amit is from Kolkata, but is not an Architect.
4. Chetan is from Delhi.
5. Divya is from Mumbai.
Deduce the full profile (Profession and City) for all four professionals.
- City Mapping: From Clue 3, $\text{City}(\text{Amit}) = \text{Kolkata}$. From Clue 4, $\text{City}(\text{Chetan}) = \text{Delhi}$. From Clue 5, $\text{City}(\text{Divya}) = \text{Mumbai}$. By elimination of the 4 cities, Bhavna must reside in Bengaluru: $\text{City}(\text{Bhavna}) = \text{Bengaluru}$.
- Doctor Assignment: From Clue 1, the Doctor is from Mumbai. Since Divya is from Mumbai, Divya MUST be the Doctor: $\text{Prof}(\text{Divya}) = \text{Doctor}$.
- Engineer Assignment: Clue 2 directly states: $\text{Prof}(\text{Bhavna}) = \text{Engineer}$.
- Remaining Professions: Remaining for Amit and Chetan are Architect and Lawyer. Clue 3 states Amit is NOT an Architect. Therefore, Amit MUST be the Lawyer: $\text{Prof}(\text{Amit}) = \text{Lawyer}$.
- Final Elimination: By elimination, Chetan MUST be the Architect: $\text{Prof}(\text{Chetan}) = \text{Architect}$.
• Amit: Lawyer from Kolkata
• Bhavna: Engineer from Bengaluru
• Chetan: Architect from Delhi
• Divya: Doctor from Mumbai
Clues:
1. Math is scheduled on Thursday.
2. English is scheduled earlier in the week, with exactly two lectures between English and Math.
3. Chemistry is scheduled immediately after Physics.
4. History is scheduled on Saturday.
Determine the complete weekly timetable and state which lecture is held on Tuesday.
- Clue 1 (Anchor): $\text{Day}(\text{Math}) = \text{Thursday}$ (Day 4).
- Clue 2 (Precedence & Gap): English is scheduled before Math with exactly two days between them: $\text{Day}(\text{Math}) - \text{Day}(\text{English}) = 3 \implies 4 - 3 = 1$. Thus, $\text{Day}(\text{English}) = \text{Monday}$ (Day 1).
- Clue 4 (Anchor): $\text{Day}(\text{History}) = \text{Saturday}$ (Day 6).
- Clue 3 (Consecutive Block): Chemistry is immediately after Physics, forming block $[\text{Physics}][\text{Chemistry}]$.
Currently occupied days: Mon(English), Thu(Math), Sat(History).
Empty days available: Tuesday (2), Wednesday (3), and Friday (5).
The ONLY available consecutive pair is Tuesday and Wednesday!
Therefore: $\text{Day}(\text{Physics}) = \text{Tuesday}$ and $\text{Day}(\text{Chemistry}) = \text{Wednesday}$. - Elimination: The sole remaining empty day is Friday (5), which must take the remaining subject, Biology: $\text{Day}(\text{Biology}) = \text{Friday}$.
Clues:
1. $V$ does not live on an odd-numbered floor, and does not live on floor 4.
2. $W$ does not live on an even-numbered floor, and does not live on floor 1.
3. $Y$ does not live on floor 2, 4, or 5.
4. $Z$ does not live on floor 1, and does not live adjacent to $V$.
5. $X$ does not live on floor 1, and does not live on a higher floor than $W$.
Identify the floor of each resident and state who lives on Floor 3.
- Clue 1 (Deduce $V$): $V \notin \{1, 3, 5\}$ and $V \ne 4$. The only remaining floor in $\{1, 2, 3, 4, 5\}$ is 2. Thus, $\text{Floor}(V) = 2$!
- Clue 4 (Deduce $Z$): $Z \ne 1$ and $Z$ is not adjacent to $V$ (Floor 2). This eliminates Floor 1 and Floor 3 for $Z$. Thus $Z \in \{4, 5\}$.
- Clue 3 (Deduce $Y$): $Y \notin \{2, 4, 5\}$. Thus $Y \in \{1, 3\}$.
- Clue 2 (Deduce $W$): $W \notin \{2, 4\}$ and $W \ne 1$. Thus $W \in \{3, 5\}$.
- Clue 5 (Cross-deduction on $X$ and $W$): $X \ne 1$. Also $X \ne 2$ (since $V=2$). So $X \in \{3, 4, 5\}$.
Clue 5 states $X \le W$.
If $W$ were on Floor 3, then $X$ would have to be $< 3$, which requires $X \in \{1, 2\}$, but both 1 and 2 are ruled out for $X$!
Therefore, $W$ CANNOT be on Floor 3. Hence, $\text{Floor}(W) = 5$! - Cascading Confirmations:
• Since $W=5$ and $Z \in \{4, 5\}$, $Z$ must take Floor 4: $\text{Floor}(Z) = 4$!
• For $X \in \{3, 4, 5\}$, floors 4 and 5 are now taken by $Z$ and $W$. Thus: $\text{Floor}(X) = 3$!
• For $Y \in \{1, 3\}$, floor 3 is taken by $X$. Thus: $\text{Floor}(Y) = 1$!
Clues:
1. Alpha receives either 10L or 40L (exclusive OR).
2. If Alpha receives 40L, then Beta receives 20L.
3. If Beta receives 20L, Delta cannot receive 10L.
4. Beta receives a strictly higher budget than Alpha ($\beta > \alpha$).
5. Gamma receives a higher budget than Delta ($\gamma > \delta$).
6. Gamma receives a higher budget than Beta ($\gamma > \beta$).
7. Delta does not receive 30L.
Find the exact budget allocated to each project.
- Branch on Clue 1 ($\alpha \in \{10, 40\}$):
• Hypothesis 1: Suppose $\alpha = 40\text{L}$.
By Clue 4, $\beta > \alpha \implies \beta > 40\text{L}$. But the maximum grant in the pool is 40L! No budget exists greater than 40L!
Contradiction! Hypothesis 1 is mathematically impossible!
• Therefore, Alpha CANNOT receive 40L. By exclusive OR, $\text{Alpha} = 10\text{L}$! - Available Pool: With $\alpha = 10\text{L}$, the remaining budgets for $\{\beta, \gamma, \delta\}$ are $\{20\text{L}, 30\text{L}, 40\text{L}\}$.
- Deduce Gamma: From Clue 6, $\gamma > \beta$. From Clue 5, $\gamma > \delta$. Since Gamma is strictly greater than both remaining projects, Gamma must take the absolute maximum of the remaining pool: $\text{Gamma} = 40\text{L}$!
- Deduce Delta and Beta: Remaining for $\{\beta, \delta\}$ are $\{20\text{L}, 30\text{L}\}$.
Clue 7 explicitly forbids Delta from receiving 30L: $\delta \ne 30\text{L}$.
Therefore, $\text{Delta} = 20\text{L}$!
By elimination, $\text{Beta} = 30\text{L}$! - Verification Against Every Clue:
1. $\alpha = 10 \in \{10, 40\}$ ✔
2. $\alpha \ne 40$, implication holds vacuously ✔
3. $\beta \ne 20$, implication holds vacuously ✔
4. $\beta (30) > \alpha (10)$ ✔
5. $\gamma (40) > \delta (20)$ ✔
6. $\gamma (40) > \beta (30)$ ✔
7. $\delta = 20 \ne 30$ ✔
Clues:
1. Bina sits at Desk 1 and has a Blue backpack.
2. The student with the Red backpack sits immediately to the left of the student with the Yellow backpack.
3. Charu sits at Desk 4.
4. Deep has a White backpack and sits to the right of Charu.
5. Arjun sits immediately next to Charu and does not have a Green backpack.
6. Charu does not have a Green backpack.
Find the complete student and backpack assignment for all five desks.
- Direct Placements:
• Clue 1: Desk 1 is Bina (Blue).
• Clue 3: Desk 4 is Charu.
• Clue 4: Deep sits to the right of Charu (Desk 4), which forces Deep to Desk 5! Deep's bag is White.
Current desk layout: $[1:\text{Bina(Blue)}][2:\_][3:\_][4:\text{Charu}][5:\text{Deep(White)}]$. - Student Placements:
• Clue 5: Arjun sits immediately next to Charu (Desk 4). Since Desk 5 is Deep, Arjun MUST sit at Desk 3!
• By elimination, the remaining student, Esha, MUST sit at Desk 2!
Student sequence is locked: 1: Bina, 2: Esha, 3: Arjun, 4: Charu, 5: Deep. - Color Attribute Placements:
• Bags already assigned: Desk 1 = Blue, Desk 5 = White.
• Colors remaining for Desks 2, 3, 4: Green, Red, Yellow.
• Clue 2: Block $[\text{Red}][\text{Yellow}]$ must take two adjacent desks!
Two possible adjacent pairs exist in $\{2, 3, 4\}$:
Possibility A: Desks 2 & 3 are Red & Yellow $\implies$ Desk 4 (Charu) gets Green.
Possibility B: Desks 3 & 4 are Red & Yellow $\implies$ Desk 2 (Esha) gets Green.
• Evaluate Clue 6: Charu does NOT have a Green backpack! This eliminates Possibility A!
• Also check Clue 5: Arjun (Desk 3) does not have Green backpack (Arjun gets Red).
• Therefore, Possibility B is uniquely forced: Desk 2 = Green, Desk 3 = Red, Desk 4 = Yellow!
• Desk 1: Bina (Blue)
• Desk 2: Esha (Green)
• Desk 3: Arjun (Red)
• Desk 4: Charu (Yellow)
• Desk 5: Deep (White)
Aptitude test setters deliberately exploit common cognitive shortcuts. Guard yourself against these 12 critical errors:
Recording only positive facts and skipping negative constraints. Negative clues prune up to 80% of branches!
Treating "somewhere to the left" as "immediately adjacent to the left". Always double-check wording!
Assuming $A \implies B$ means $B \implies A$. Only the contrapositive $\neg B \implies \neg A$ is logically valid.
Assuming each person has a unique attribute when the prompt allows multiple people to share the same department or city.
Inscribing an unconfirmed hypothesis into the main diagram in pen, then forgetting it was merely an assumption.
Failing to check whether a newly placed entity violates a negative condition recorded earlier.
Placing a confirmed item in one grid but forgetting to cross-eliminate corresponding cells in connected category grids.
Guessing a 3-way branch without tracking the assumption, leading to hopeless confusion when a clash occurs.
Mixing up clockwise (left) and counter-clockwise (right) when facing inward vs. facing outward.
Assuming a circular puzzle can be mirrored left-to-right when directional clues ("second to left") break bilateral symmetry.
Failing to verify whether multiple valid solutions exist when answering "cannot be determined" questions.
Rushing to answer questions without spending 15 seconds validating the completed layout against every clue.
Professional test-takers use these battle-tested tactical principles to consistently solve full LRDI puzzle sets in under 8 minutes:
Begin with clues that allow the fewest configurations (anchors, extreme ends, or large adjacent blocks like $[A][B][C]$).
Always place the first person at Seat 1. Eliminates $N$ redundant rotational cases instantly.
If there is an inherent natural sequence (days, floors, ranks), draw an ordered timeline, NOT a 2D cross-grid.
Write definite entries in pen; write temporary branch assumptions in pencil or inside brackets $[?]$.
Combine multiple negative exclusions for a single slot. When $N-1$ candidates are crossed out, the last one is forced.
The instant you confirm a cell in a grid, cross out its entire row and column before reading the next clue.
If branching is required, select a variable with exactly 2 possibilities. Never guess on a 3-way or 4-way split.
Encountering an impossibility on an assumed branch is great news—it immediately proves the alternate branch is true!
Before entering answers into your test console, re-read all original clues once against your completed grid.
If a branch runs deeper than 3 unverified steps without a contradiction or proof, backtrack immediately.
Test your mastery against these 12 original, algorithmically verified logical puzzles progressing from Easy to Hard. Click Show Solution on each problem to inspect the complete deductive proof:
1. $K$ sits at the center seat (Seat 3).
2. $J$ sits immediately to the left of $K$.
3. $M$ sits at one of the extreme ends.
4. $L$ does not sit at an extreme end.
5. $N$ sits to the right of $L$.
Who sits at Seat 5?
(A) J (B) L (C) M (D) N
Deductive Proof:
1. From Clue 1, $K$ is at Seat 3. From Clue 2, $J$ is immediately left of $K \implies J$ is at Seat 2.
2. Empty seats remaining are $\{1, 4, 5\}$. Clue 4 states $L$ does NOT sit at an extreme end (not Seat 1 or 5) $\implies L$ MUST sit at Seat 4!
3. Seats 1 and 5 remain for $M$ and $N$. Clue 5 states $N$ sits to the right of $L$ (Seat 4) $\implies N$ MUST sit at Seat 5!
4. By elimination, $M$ sits at Seat 1 (satisfying Clue 3: $M$ is at an extreme end).
Final Order: Seat 1: M, Seat 2: J, Seat 3: K, Seat 4: L, Seat 5: N.
1. $A$ sits at Seat 1 (Anchor).
2. $B$ sits second to the left of $A$ (clockwise).
3. $C$ sits immediately adjacent to both $A$ and $B$.
4. $D$ sits to the immediate right of $A$ (counter-clockwise).
Who sits at Seat 4 (between B and D)?
(A) B (B) C (C) D (D) E
Deductive Proof:
1. $A$ is at Seat 1. Left is clockwise: 1st left is Seat 2, 2nd left is Seat 3 $\implies B$ is at Seat 3.
2. $C$ is adjacent to both $A$ (Seat 1) and $B$ (Seat 3) $\implies C$ is at Seat 2.
3. Right is counter-clockwise: immediately right of Seat 1 is Seat 5 $\implies D$ is at Seat 5.
4. Seat 4 is the sole remaining seat, occupied by $E$.
Final Order: Seat 1: A, Seat 2: C, Seat 3: B, Seat 4: E, Seat 5: D.
1. At least one Humanities and at least one Science professor must be included.
2. $H_1$ and $S_1$ cannot serve together.
3. If $H_2$ is selected, $S_2$ must be selected.
4. $S_3$ cannot be selected.
5. $H_3$ and $S_2$ cannot serve together.
6. $H_1$ must be selected.
7. $S_2$ must be selected.
Who is the third member of the committee?
(A) H2 (B) H3 (C) S1 (D) S3
Deductive Proof:
1. From Clues 6 and 7, $H_1$ and $S_2$ are definitely selected. (Current team: $\{H_1, S_2\}$, target = 3).
2. Clue 2: Since $H_1$ is selected, $S_1$ cannot be selected ($S_1$ is OUT).
3. Clue 4: $S_3$ cannot be selected ($S_3$ is OUT).
4. Clue 5: Since $S_2$ is selected, $H_3$ cannot serve ($H_3$ is OUT).
5. Candidates eliminated: $\{S_1, S_3, H_3\}$. The ONLY candidate remaining for the 3rd seat is $H_2$!
Verify Clue 3: $H_2$ is selected and $S_2$ is selected ✔.
Final Committee: {H1, H2, S2}.
1. The student who loves Mathematics lives in Pune.
2. Tanmay loves Mathematics.
3. Rahul lives in Jaipur and does not like Economics.
4. Sneha loves History.
5. Priya does not live in Chennai.
Which subject does Priya love, and in which city does Sneha live?
(A) Priya: Economics; Sneha: Chennai (B) Priya: Psychology; Sneha: Pune
(C) Priya: Economics; Sneha: Hyderabad (D) Priya: History; Sneha: Jaipur
Deductive Proof:
1. From Clues 1 & 2: Tanmay loves Mathematics and lives in Pune: $\text{Tanmay} \to (\text{Math}, \text{Pune})$.
2. Clue 3: Rahul lives in Jaipur: $\text{Rahul} \to \text{Jaipur}$.
3. Cities remaining for Priya and Sneha: Chennai and Hyderabad. Clue 5: Priya does not live in Chennai $\implies$ Priya lives in Hyderabad, which forces Sneha to live in Chennai!
4. Clue 4: Sneha loves History. Subjects remaining for Priya and Rahul: Economics and Psychology.
5. Clue 3: Rahul does not like Economics $\implies$ Rahul loves Psychology, forcing Priya to love Economics!
Final Profiles:
• Priya: Economics, Hyderabad
• Rahul: Psychology, Jaipur
• Sneha: History, Chennai
• Tanmay: Mathematics, Pune
1. $P_1$ is presented on Tuesday.
2. Exactly one presentation takes place between $P_1$ and $P_4$, with $P_1$ presented earlier than $P_4$.
3. $P_2$ is presented on an earlier day than $P_5$.
4. $P_3$ is not presented on Friday.
5. $P_2$ is not presented on Monday.
Which presentation takes place on Wednesday?
(A) P2 (B) P3 (C) P4 (D) P5
Deductive Proof:
1. Clue 1: $P_1$ is on Tuesday (Day 2).
2. Clue 2: Exactly one presentation between $P_1$ and $P_4$ with $P_1 < P_4 \implies P_4$ is on Thursday (Day 4).
3. Days remaining: Monday (1), Wednesday (3), Friday (5) for $\{P_2, P_3, P_5\}$.
4. Clue 5: $P_2$ is not on Monday. Clue 3: $P_2 < P_5$, so $P_2$ cannot be on the final day (Friday). Thus $P_2$ MUST be on Wednesday!
5. Since $P_2 < P_5$, $P_5$ must be after Wednesday $\implies P_5$ is on Friday.
6. By elimination, $P_3$ is on Monday (satisfying Clue 4: $P_3$ is not on Friday).
Final Schedule: Mon: P3, Tue: P1, Wed: P2, Thu: P4, Fri: P5.
1. $R_1$ does not finish in 1st or 5th position.
2. $R_3$ finishes ahead of $R_1$, but does not finish in 1st or 2nd position.
3. $R_2$ does not finish in 2nd or 4th position.
4. $R_4$ finishes behind $R_5$ ($R_5 < R_4$).
5. $R_5$ does not finish in 1st position.
Who wins the race (finishes in 1st position)?
(A) R1 (B) R2 (C) R3 (D) R5
Deductive Proof:
1. From Clue 2: $R_3$ finishes ahead of $R_1$ ($R_3 < R_1$), but $R_3 \notin \{1, 2\}$. Therefore, $R_3$ can only be 3rd or 4th.
If $R_3$ were 4th, $R_1$ would have to be 5th. But Clue 1 forbids $R_1$ from 5th! Thus, $R_3$ MUST finish in 3rd position!
2. Since $R_3 = 3\text{rd}$ and $R_3 < R_1$, $R_1$ must be 4th (as 5th is prohibited by Clue 1). So $R_1 = 4\text{th}$.
3. Positions remaining for $\{R_2, R_4, R_5\}$ are $\{1\text{st}, 2\text{nd}, 5\text{th}\}$.
4. Clue 4 & 5: $R_5$ is not 1st, and $R_5 < R_4$. Therefore, $R_5$ cannot be 5th (since someone finishes behind him). Thus $R_5$ MUST be 2nd!
5. Since $R_5 < R_4$, $R_4$ must be 5th position.
6. By elimination, $R_2$ finishes in 1st position (satisfying Clue 3: $R_2$ is not 2nd or 4th).
Final Ranks: 1st: R2, 2nd: R5, 3rd: R3, 4th: R1, 5th: R4.
1. If Dev is selected, then Maya cannot be selected ($\text{Dev} \implies \neg\text{Maya}$).
2. Neil and Ritu must either both be selected or neither selected.
3. If Sam is selected, then Dev must be selected ($\text{Sam} \implies \text{Dev}$).
4. Tara is always selected.
5. If Maya is not selected, then Sam must be selected ($\neg\text{Maya} \implies \text{Sam}$).
Which 4 engineers form the team?
(A) Dev, Sam, Neil, Tara (B) Maya, Neil, Ritu, Tara
(C) Dev, Maya, Tara, Sam (D) Ritu, Neil, Sam, Dev
Deductive Proof:
1. Clue 4: Tara is definitely selected. (3 members remaining).
2. Branch on whether Maya is selected:
• Branch 1 (Maya is NOT selected): Clue 5 states $\neg\text{Maya} \implies \text{Sam}$ is in. By Clue 3, $\text{Sam} \implies \text{Dev}$ is in. Now team has $\{$Tara, Sam, Dev$\}$. Exactly 1 spot remains. But Clue 2 dictates Neil and Ritu must be selected together (requires 2 spots!) or neither. If neither, we have only 3 members! Contradiction! Branch 1 is REJECTED.
• Branch 2 (Maya IS selected): Since Maya is in, Clue 1 (contrapositive $\text{Maya} \implies \neg\text{Dev}$) forces Dev to be OUT. Since Dev is out, Clue 3 (contrapositive $\neg\text{Dev} \implies \neg\text{Sam}$) forces Sam to be OUT.
3. With Dev and Sam both OUT, candidates remaining for the 2 empty spots are Neil and Ritu. Clue 2 confirms both can be selected together!
Final Team: {Maya, Neil, Ritu, Tara}.
1. $U$ sits directly opposite $X$ (Anchor $U$ at Seat 1, so $X$ is at Seat 4).
2. $V$ sits second to the right of $U$ (counter-clockwise).
3. $W$ is an immediate neighbour of $X$.
4. $Y$ sits to the immediate left of $U$ (clockwise).
Who sits directly opposite W?
(A) U (B) V (C) Y (D) Z
Deductive Proof:
1. Fix Anchor $U$ at Seat 1. Clue 1: Opposite Seat 1 is Seat 4 $\implies X$ is at Seat 4.
2. Clue 2: Right is counter-clockwise. 2nd right of Seat 1 is Seat 5 $\implies V$ is at Seat 5.
3. Clue 3: $W$ is adjacent to $X$ (Seat 4). The neighbours of Seat 4 are Seats 3 and 5. Since Seat 5 is occupied by $V$, $W$ MUST be at Seat 3!
4. Clue 4: Left is clockwise. Immediately left of Seat 1 is Seat 2 $\implies Y$ is at Seat 2.
5. Seat 6 is the sole remaining seat, occupied by $Z$.
Clockwise Arrangement: Seat 1: U, Seat 2: Y, Seat 3: W, Seat 4: X, Seat 5: V, Seat 6: Z.
Seat opposite $W$ (Seat 3) is $3 + 3 = 6$, which is $Z$!
1. Kabir works in Tech and uses Python.
2. The consultant who uses SQL works in Banking.
3. Leela uses Tableau.
4. Meera does not work in Banking.
5. The consultant who works in Retail uses Tableau.
Which industry does Meera work in, and which software does Nikhil use?
(A) Meera: Healthcare; Nikhil: SQL (B) Meera: Retail; Nikhil: Python
(C) Meera: Banking; Nikhil: R (D) Meera: Healthcare; Nikhil: Tableau
Deductive Proof:
1. Clue 1: Kabir $\to$ Tech, Python.
2. Clues 3 & 5: Leela uses Tableau, and the consultant in Retail uses Tableau. Therefore, Leela works in Retail: $\text{Leela} \to \text{Retail}, \text{Tableau}$.
3. Industries remaining for Meera and Nikhil: Banking and Healthcare. Clue 4 states Meera does not work in Banking $\implies$ Meera works in Healthcare, forcing Nikhil to work in Banking!
4. Clue 2: The consultant in Banking uses SQL. Since Nikhil is in Banking, Nikhil uses SQL!
5. By elimination, Meera uses R.
Final Matrix:
• Kabir: Tech, Python
• Leela: Retail, Tableau
• Meera: Healthcare, R
• Nikhil: Banking, SQL
1. $D$ sits at the exact center chair (Chair 4).
2. $A$ sits at one of the extreme ends.
3. Exactly one person sits between $A$ and $B$.
4. $C$ sits immediately to the right of $B$.
5. $E$ sits immediately to the left of $G$.
6. $F$ does not sit at an extreme end.
Who sits at Chair 1, and who sits at Chair 3?
(A) Chair 1: E; Chair 3: F (B) Chair 1: A; Chair 3: B
(C) Chair 1: G; Chair 3: E (D) Chair 1: F; Chair 3: D
Deductive Proof:
1. Clue 1: $D$ is at Chair 4: $[\_][\_][\_][D][\_][\_][\_]$.
2. Branch on Clue 2 ($A \in \{1, 7\}$):
• Hypothesis 1 ($A = 1$): One person between $A$ and $B \implies B = 3$. Clue 4: $C$ immediately right of $B \implies C = 4$. But Chair 4 is already occupied by $D$! Contradiction! Thus $A$ CANNOT sit at Chair 1.
• Hypothesis 2 ($A = 7$): One person between $A$ and $B \implies B = 5$. Clue 4: $C$ immediately right of $B \implies C = 6$.
3. Current layout: $[\_][\_][\_][D][B][C][A]$. Empty chairs: $\{1, 2, 3\}$ for $\{E, F, G\}$.
4. Clue 5: Block $[E][G]$ must take consecutive chairs $\{1, 2\}$ or $\{2, 3\}$.
If $[E][G]$ takes $\{2, 3\}$, then $F$ is forced to Chair 1. But Clue 6 forbids $F$ from an extreme end!
Therefore, $[E][G]$ MUST occupy Chairs 1 and 2 ($E=1, G=2$).
5. By elimination, $F$ sits at Chair 3 (satisfying Clue 6: $F=3$ is not an end).
Final Order: Chair 1: E, Chair 2: G, Chair 3: F, Chair 4: D, Chair 5: B, Chair 6: C, Chair 7: A.
1. $P$ sits at Desk 1.
2. $R$ sits at Desk 3.
3. The user of Revit sits immediately to the left of the user of Rhino.
4. $P$ uses AutoCAD.
5. $T$ uses Blender and sits at Desk 5.
6. $Q$ sits at Desk 2 and does not use Revit.
Which software does Q use, and who uses Revit?
(A) Q: SketchUp; R uses Revit (B) Q: Rhino; S uses Revit
(C) Q: Blender; P uses Revit (D) Q: SketchUp; T uses Revit
Deductive Proof:
1. People positions: Clues 1, 6, 2, 5 give $P=1, Q=2, R=3, T=5$. The sole remaining desk for $S$ is Desk 4.
Student sequence: Desk 1: P, Desk 2: Q, Desk 3: R, Desk 4: S, Desk 5: T.
2. Software assignments: Desk 1 = AutoCAD, Desk 5 = Blender.
3. Remaining desks for software $\{2, 3, 4\}$ are for $\{\text{Revit}, \text{Rhino}, \text{SketchUp}\}$.
4. Clue 3: Block $[\text{Revit}][\text{Rhino}]$ must occupy consecutive desks in $\{2, 3, 4\}$.
If it occupied $\{2, 3\}$, then Desk 2 would be Revit. But Clue 6 explicitly states $Q$ (Desk 2) does NOT use Revit!
Therefore, block $[\text{Revit}][\text{Rhino}]$ MUST occupy Desks 3 and 4!
Thus: Desk 3 ($R$) uses Revit, and Desk 4 ($S$) uses Rhino!
5. By elimination, Desk 2 ($Q$) MUST use SketchUp!
Final Solution:
• Desk 1: P (AutoCAD)
• Desk 2: Q (SketchUp)
• Desk 3: R (Revit)
• Desk 4: S (Rhino)
• Desk 5: T (Blender)
1. Drama is held in the Auditorium in the Morning.
2. Music and Dance are both held in the Afternoon, but in different venues.
3. Quiz is held in Hall A in the Morning.
4. Debate is held in the Auditorium in the Afternoon.
5. Music is held in Hall B.
In which venue and slot is Dance held, and which event is held in Hall B in the Morning?
(A) Dance: Hall A (Afternoon); Art: Hall B (Morning)
(B) Dance: Auditorium (Afternoon); Music: Hall B (Morning)
(C) Dance: Hall B (Afternoon); Quiz: Hall A (Morning)
(D) Dance: Hall A (Morning); Art: Hall B (Afternoon)
Deductive Proof:
1. Total available slots: 6 combinations of $(\text{Venue}, \text{Slot})$.
2. Clue 1: $\text{Auditorium (Morning)} = \text{Drama}$.
3. Clue 4: $\text{Auditorium (Afternoon)} = \text{Debate}$. (Auditorium is completely full!).
4. Clue 3: $\text{Hall A (Morning)} = \text{Quiz}$.
5. Clue 5: Music is in Hall B. Clue 2: Music is in the Afternoon $\implies \text{Hall B (Afternoon)} = \text{Music}$.
6. Clue 2: Dance is also in the Afternoon, in a different venue. Since Auditorium (Afternoon) is Debate and Hall B (Afternoon) is Music, Dance MUST be in Hall A (Afternoon)!
7. The only unassigned slot is Hall B (Morning), which must take the remaining event, Art!
Final Grid:
• Auditorium: Morning = Drama | Afternoon = Debate
• Hall A: Morning = Quiz | Afternoon = Dance
• Hall B: Morning = Art | Afternoon = Music
1. What is a logical puzzle?
A logical puzzle is a structured reasoning problem presenting entities, attributes, and slots connected by verbal clues. The task is to deduce the unique valid assignment or arrangement satisfying all conditions simultaneously without real-world assumptions.
2. How do I start solving a multi-clue puzzle?
Draw the correct representation first (linear strip, circular dial, or cross-matching table). Then scan for anchor clues that establish an absolute coordinate or fused multi-person block. Fill in direct facts first before processing relative or conditional rules.
3. When should I use a table or grid?
Use a 2D cross-grid when two or three non-ordered categories (such as people, professions, and car models) must be matched one-to-one. If an intrinsic natural order exists (days of the week, building floors, race finishing ranks), use an ordered slot timeline instead.
4. What is constraint propagation?
Constraint propagation is the deductive chain reaction where confirming one assignment immediately eliminates options across connected rows, columns, and conditional rules, forcing downstream deductions without guessing.
5. When should I use backtracking?
Use backtracking only when all direct deductions are exhausted and a variable is reduced to exactly two valid candidates. Make a temporary assumption on one branch, follow its consequences, and if a contradiction arises, immediately finalize the opposite branch.
6. How do I distinguish a confirmed fact from a possibility?
A confirmed fact is an assignment that holds true across every possible valid diagram. A possibility is compatible with current clues but has not yet been proven unique. Never write a possibility into your main diagram as a definite entry.
7. How do I handle negative clues?
Negative clues eliminate options. Mark crosses (✘) in matching grids or strike out elements from possibility sets. When $N-1$ options are eliminated for a slot, the remaining candidate is mathematically confirmed.
8. How do I solve circular arrangements without counting equivalent rotations multiple times?
Fix an arbitrary person (the anchor) at Seat 1. In a circle, all starting positions are rotationally identical, so placing the first person eliminates all $N$ rotational redundancies and establishes fixed relative coordinates.
9. How can I verify that a puzzle has a unique solution?
Verify uniqueness by checking your final assignment against 100% of original clues, confirming category quotas are satisfied, and ensuring that at any branch point, all alternative branches were proven to cause a logical contradiction.
Logical Puzzles form the pinnacle of multi-constraint analytical deduction. Strengthen your problem-solving toolkit across these connected Vault modules:
Advance to Series — master number and letter sequences, alternate patterns, difference-of-differences, and missing-term shortcuts for CAT, XAT, and MBA CET.