Introduction
The Tabular Puzzle asks you to organise multi-attribute data (people, places, jobs, colours, months, etc.) into a table using given clues. This pattern trains systematic elimination, linking clues across attributes, and accurate final matching.
It is widely tested in competitive exams (SBI PO, IBPS, SSC, CAT) because it evaluates careful deduction and attention to detail. Good table design and stepwise elimination make these problems straightforward and reproducible.
Pattern: Tabular Puzzle
Pattern
Convert clues into table entries and use elimination + linking to fill every cell.
- Represent each entity (person/item) as a row; attributes (city, job, day) are columns.
- Mark direct facts first, then apply “not” clues to eliminate options.
- Use linking clues (e.g., “the person from X is a Y”) to lock two attributes together.
- Iterate: filling one cell often forces others - keep the table updated.
Step-by-Step Example
Question
Four friends - A, B, C, and D - live in different cities: Delhi, Mumbai, Kolkata, and Chennai. Each works in a different profession: Doctor, Engineer, Teacher, and Lawyer.
Clues:
- B is not from Delhi or Chennai.
- The person from Kolkata is a Teacher.
- D is a Lawyer and does not live in Mumbai.
- A lives in Delhi.
Question: Who lives in Chennai?
Options:
A) B B) C C) D D) A
Solution
-
Step 1: Mark direct facts
A → Delhi; D → Lawyer; D ≠ Mumbai; Kolkata → Teacher (city-profession link). -
Step 2: Build an initial table (partial)
Person City Profession A Delhi - B Not Delhi, Not Chennai - C - Teacher (if Kolkata) D Not Mumbai Lawyer -
Step 3: Apply elimination and linking
B cannot be Delhi/Chennai → B must be Mumbai or Kolkata. D is not Mumbai and is Lawyer → D cannot be Kolkata (because Kolkata → Teacher). A is Delhi → remaining cities: Mumbai, Kolkata, Chennai for B, C, D. Since Kolkata → Teacher and D is Lawyer, C must be Kolkata & Teacher. -
Step 4: Complete the final table
Person City Profession A Delhi Engineer B Mumbai Doctor C Kolkata Teacher D Chennai Lawyer -
Final Answer:
D (D lives in Chennai) → Option C -
Quick Check:
A = Delhi ✅; D = Lawyer and ≠ Mumbai → D = Chennai ✅; Kolkata → Teacher → C = Kolkata & Teacher ✅; B cannot be Delhi/Chennai → B = Mumbai ✅
Quick Variations
1. Two-attribute tables: Person × City.
2. Three-attribute tables: Person × City × Profession (use 2D grid with linked cells).
3. Conditional tables: include "either-or", "exactly one matches" clues.
4. Larger tables (5×5): use progressive elimination and intermediate partial tables.
Trick to Always Use
- Step 1: Create a clear table and mark direct facts first (use ticks / 'not' marks mentally).
- Step 2: Lock any two-attribute links (e.g., Kolkata = Teacher) early - they reduce choices faster.
- Step 3: Fill forced cells next; each forced fill cascades into more eliminations.
- Step 4: Use a final table in the solution to present the completed mapping clearly.
Summary
Summary
- Start by marking direct facts and obvious 'not' entries in a grid.
- Lock combined clues (city-profession) early to reduce possibilities.
- Iteratively fill forced cells; keep the table updated after each step.
- Use a final table in your solution - it makes verification quick and foolproof.
Example to remember:
When a clue links two attributes (e.g., Kolkata = Teacher), assign that pair first - then eliminate that city and profession for others.
