Study guide

6.3 Grouping, Selection & Constraint Matrix Puzzles

Higher Education Aptitude Test HAT

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Overview, Test Categories & Exam Strategy

1.1 HEC HAT Examination Structure, ETC Portal & Test Categories 1.2 Scoring, Validity, Pass Marks & Admission Logistics 1.3 Strategic Time Management & Test-Taking Tactics

2 Chapter 2: Verbal Reasoning — Vocabulary, Analogies & Grammar

2.1 Sample-Based HAT Vocabulary & Word Relationships 2.2 Verbal Analogies — Semantic & Functional Relationships 2.3 Sentence Completion — Single-Blank & Double-Blank Tactics 2.4 English Grammar, Syntax & Error Identification

3 Chapter 3: Verbal Reasoning — Reading Comprehension & Textual Analysis

3.1 Reading Comprehension — Main Idea & Structural Analysis 3.2 Critical Reading Inferences & Contextual Vocabulary 3.3 Evaluating Arguments & Logical Flow in Academic Reading

4 Chapter 4: Quantitative Reasoning — Arithmetic, Ratios & Word Problems

4.1 Fundamental Arithmetic & Percentage Applications 4.2 Ratios, Proportions, Mixtures & Weighted Averages 4.3 Rates, Work-Time & Distance-Speed Word Problems 4.4 Permutations, Combinations & Probability Principles

5 Chapter 5: Quantitative Reasoning — Algebra, Geometry & Data Interpretation

5.1 Algebraic Equations, Inequalities & Functions 5.2 Plane Geometry — Lines, Triangles & Circles 5.3 Coordinate Geometry, Area & Volume Mensuration 5.4 Data Interpretation — Tables, Graphs & Charts

6 Chapter 6: Analytical Reasoning — Logic Puzzles, Sequences & Critical Reasoning

6.1 Formal Logic, Syllogisms & Venn Diagrams 6.2 Linear Ordering & Circular Seating Puzzles 6.3 Grouping, Selection & Constraint Matrix Puzzles 6.4 Critical Reasoning — Assumptions, Arguments & Flaws 6.5 Pattern Recognition, Number Series & Symbol Analogies

6.3 Grouping, Selection & Constraint Matrix Puzzles

Key Takeaways Explain This Topic AI

Grouping and selection puzzles require forming teams or subsets from a pool of candidates under strict conditional rules and capacity constraints.

Conditional selection rules follow formal logic: 'If A is selected, B must be selected' means selecting A forces B, but selecting B does not force A.

Mutual exclusion ('A and B cannot both be selected') means selecting A forces the rejection of B and vice versa, preventing both from appearing together.

Multi-variable constraint matrix puzzles organize heterogeneous variables into 2D or 3D grids using checkmarks for positive matches and crosses for negative matches.

The single-fill elimination rule dictates that once a positive match (checkmark) is placed in a 1-to-1 sub-grid, all remaining cells in that row and column must be crossed out.

Last updated: July 2026

6.3 Grouping, Selection & Constraint Matrix Puzzles

Grouping and selection puzzles constitute a core category of Analytical Reasoning on the HEC HAT. Unlike linear or circular ordering puzzles where relative position is key, selection puzzles focus on membership inclusion and exclusion . Candidates are required to select a sub-group (e.g., a 4-person research committee) from a larger pool of applicants (e.g., 7 candidates) subject to formal logical rules, discipline balance requirements, and multi-variable constraint matrices.

Selection Rules & Formal Logical Translation

Every grouping puzzle translates narrative constraints into formal logical rules. Mastering these translations prevents logical misinterpretations under time pressure.

Fundamental Selection Rules

  • Conditional Selection Rule : "If Candidate A is selected, then Candidate B must also be selected."
  • Formal Translation : A → B A \rightarrow B A → B

Contrapositive : ¬ B → ¬ A \neg B \rightarrow \neg A ¬ B → ¬ A (If B is not selected, A cannot be selected).

Common Pitfall : If B is selected, A does not necessarily have to be selected ( B ↛ A B \not\rightarrow A B  → A ).

Mutual Exclusion Rule : "Candidate A and Candidate B cannot both be selected for the committee."

Formal Translation : A → ¬ B A \rightarrow \neg B A → ¬ B (or B → ¬ A B \rightarrow \neg A B → ¬ A ).

Meaning : At most one of them can be selected. Both can be rejected, but both can never be included simultaneously.

  • Bi-conditional Selection Rule : "Candidate A is selected if and only if Candidate B is selected."
  • Formal Translation : A ↔ B A \leftrightarrow B A ↔ B

Meaning : Either both A A A and B B B are selected together ( A ∧ B A \land B A ∧ B ), or both are rejected together ( ¬ A ∧ ¬ B \neg A \land \neg B ¬ A ∧ ¬ B ).

Floor and Ceiling Constraints :

  • Floor Constraint : "The committee must include at least two female researchers."
  • Ceiling Constraint : "No more than three engineers can be assigned to Team Alpha."
  • Multi-Variable Constraint Matrix Grids

When a puzzle involves matching multiple distinct categories of attributes (e.g., matching 4 Professors to 4 Universities, 4 Research Topics, and 4 Cities), constructing a Constraint Matrix Grid is mandatory. Multi-Variable Constraint Matrix Setup

  • ┌───────────────────────┬───────────────────────┐
  • │ Universities │ Research Topics │
  • ├───────┬───────┬───────┼───────┬───────┬───────┤
  • │ NUST │ QAU │ UET │ AI │ Bio │ Nano │
  • ┌───────────────┼───────┼───────┼───────┼───────┼───────┼───────┤
  • │ Prof. Ali │ ✓ │ ✗ │ ✗ │ ✗ │ ✓ │ ✗ │
  • ├───────────────┼───────┼───────┼───────┼───────┼───────┼───────┤
  • │ Prof. Bilal │ ✗ │ ✓ │ ✗ │ ✓ │ ✗ │ ✗ │
  • ├───────────────┼───────┼───────┼───────┼───────┼───────┼───────┤
  • │ Prof. Tariq │ ✗ │ ✗ │ ✓ │ ✗ │ ✗ │ ✓ │
  • └───────────────┴───────┴───────┴───────┴───────┴───────┴───────┘

Matrix Deduction Rules:

Positive Match ( ✓ \checkmark ✓ ) Execution : When a positive match is established between Person X X X and Attribute Y Y Y , immediately place crosses ( × \times × ) across all remaining cells in X X X 's row and Y Y Y 's column within that sub-grid.

Negative Elimination ( × \times × ) Execution : When N − 1 N - 1 N − 1 cells in a row or column are filled with crosses ( × \times × ), the remaining single empty cell must automatically be a positive match ( ✓ \checkmark ✓ ).

Transitive Linking : If Person X X X matches University U 1 U_1 U 1 ​ ( ✓ \checkmark ✓ ), and University U 1 U_1 U 1 ​ is known to match Topic T 1 T_1 T 1 ​ ( ✓ \checkmark ✓ ), then Person X X X must also match Topic T 1 T_1 T 1 ​ ( ✓ \checkmark ✓ ).

Committee Formation & Group Transfer Puzzles

In group formation puzzles, candidates are partitioned into two or more non-overlapping teams (e.g., Team Alpha and Team Beta). Clues specify inter-group dependencies:

"If Dr. Khan is in Team Alpha, Dr. Ahmed must be in Team Beta." ( K h a n A → A h m e d B Khan_A \rightarrow Ahmed_B K ha n A ​ → A hm e d B ​ )

"Prof. Usman and Prof. Tariq must be in the same team." ( U s m a n A ↔ T a r i q A Usman_A \leftrightarrow Tariq_A U s ma n A ​ ↔ T a r i q A ​ and U s m a n B ↔ T a r i q B Usman_B \leftrightarrow Tariq_B U s ma n B ​ ↔ T a r i q B ​ )

Systematic Grouping Algorithm:

Identify Fixed Anchors : Place candidates whose team assignments are explicitly stated.

Evaluate Incompatible Pairs : Identify mutually exclusive pairs that must be split across different teams.

Track Team Capacity : Continuously count current team members against maximum group limits to identify forced transfers.

  • Full Worked Examples
  • Selection Problem Worked Example

Problem : A 4-member research panel must be selected from 7 candidates: three Senior Fellows (A, B, C) and four Junior Fellows (W, X, Y, Z).

Rule 1 : The panel must include exactly two Senior Fellows and two Junior Fellows.

Rule 2 : If A is selected, W must be selected ( A → W A \rightarrow W A → W ).

Rule 3 : B and X cannot both be selected ( B → ¬ X B \rightarrow \neg X B → ¬ X ).

Rule 4 : C and Y must be selected together ( C ↔ Y C \leftrightarrow Y C ↔ Y ).

Question : If B is selected for the panel, which of the following is a valid 4-member panel?

Step-by-Step Solution :

Apply Rule 1 : Panel needs 2 Seniors from { A , B , C } \{A, B, C\} { A , B , C } and 2 Juniors from { W , X , Y , Z } \{W, X, Y, Z\} { W , X , Y , Z } .

Incorporate Given Condition : B B B is selected. Thus, one Senior slot is filled by B B B .

Apply Rule 3 : Since B B B is selected, X X X CANNOT be selected ( X X X is eliminated).

Remaining Junior pool: { W , Y , Z } \{W, Y, Z\} { W , Y , Z } . Need to select 2 Juniors from this pool.

Evaluate Second Senior Slot : Either A A A or C C C must be selected.

Case I: Select A A A as the 2nd Senior .

Panel Seniors: { B , A } \{B, A\} { B , A } .

By Rule 2 ( A → W A \rightarrow W A → W ), W W W must be selected.

Since X X X is eliminated, the 2nd Junior must be either Y Y Y or Z Z Z .

Can Y Y Y be selected? Rule 4 states C ↔ Y C \leftrightarrow Y C ↔ Y . Since C C C is NOT selected, Y Y Y CANNOT be selected! Thus Y Y Y is eliminated.

Therefore, the 2nd Junior MUST be Z Z Z .

Valid Panel Case I : { A , B , W , Z } \{A, B, W, Z\} { A , B , W , Z } .

Case II: Select C C C as the 2nd Senior .

Panel Seniors: { B , C } \{B, C\} { B , C } .

By Rule 4 ( C ↔ Y C \leftrightarrow Y C ↔ Y ), Y Y Y MUST be selected.

Need one more Junior from { W , Z } \{W, Z\} { W , Z } .

Since A A A is NOT selected, Rule 2 ( A → W A \rightarrow W A → W ) does not force or prohibit W W W .

Valid Panel Case II : { B , C , Y , W } \{B, C, Y, W\} { B , C , Y , W } or { B , C , Y , Z } \{B, C, Y, Z\} { B , C , Y , Z } .

Conclusion: Valid panels under B B B 's selection are { A , B , W , Z } \{A, B, W, Z\} { A , B , W , Z } , { B , C , W , Y } \{B, C, W, Y\} { B , C , W , Y } , or { B , C , Y , Z } \{B, C, Y, Z\} { B , C , Y , Z } .