Study guide
14.1 Grouping, Distribution & Bin-Assignment Puzzles
NTS Graduate Assessment Test GAT General
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: GAT General Overview & Test Administration
1.1 GAT General Test Structure & Logistics 1.2 Time Management & No-Negative-Marking Strategy 1.3 GAT Test Categories & Admissions Alignment
2 Chapter 2: Verbal Reasoning — Vocabulary, Analogies & Word Roots
2.1 Verbal Analogies & Relationship Mapping 2.2 Synonyms, Antonyms & Contextual Meaning 2.3 High-Frequency NTS Vocabulary & Word Roots
3 Chapter 3: Verbal Reasoning — Sentence Completion & Reading Comprehension
3.1 Sentence Completion & Single/Double-Blank Strategies 3.2 Reading Comprehension & Textual Analysis 3.3 Essential English Grammar & Sentence Structure
4 Chapter 4: Verbal Reasoning — Grammar: Tenses, Structure & Conditionals
4.1 Tenses & Aspects I: Simple and Progressive Forms 4.2 Tenses & Aspects II: Perfect Forms, Sequence of Tenses & Voice 4.3 Parts of Speech in Depth: Articles, Prepositions & Determiners 4.4 Conditional Sentences & Hypothetical Structures
5 Chapter 5: Verbal Reasoning — Language Functions & Passage Analysis
5.1 Language Functions & Situational Appropriacy 5.2 Linking Devices, Transitions & Textual Cohesion 5.3 Main Idea, Title Selection & Topic Sentences 5.4 Types of Passage, Author's Purpose & Tone
6 Chapter 6: Quantitative Reasoning — Arithmetic & Number Theory
6.1 Number Properties, Divisibility Rules & Prime Factorization 6.2 Fractions, Decimals, Percentages & Profit-Loss Math 6.3 Ratios, Proportions, Mixtures & Work-Time Rates
7 Chapter 7: Quantitative Reasoning — Business, Consumer & Islamic Financial Mathematics
7.1 Business, Financial & Consumer Mathematics 7.2 Zakat, Ushar & Inheritance Calculations
8 Chapter 8: Quantitative Reasoning — Algebra & Equations
8.1 Algebraic Simplification, Exponent Rules & Radicals 8.2 Linear Equations, Systems & Quadratic Equations 8.3 Inequalities, Absolute Value & Function Basics
9 Chapter 9: Quantitative Reasoning — Matrices, Sequences, Sets & Functions
9.1 Matrices & Determinants 9.2 Arithmetic & Geometric Sequences 9.3 Sets, Venn Relations & Functions
10 Chapter 10: Quantitative Reasoning — Geometry & Measurement
10.1 Lines, Angles, Triangles & Pythagorean Theorem 10.2 Quadrilaterals, Polygons, Circles & Coordinate Geometry 10.3 Perimeter, Area, Surface Area & 3D Volume Calculations
11 Chapter 11: Quantitative Reasoning — Triangle Theorems, Circles & Trigonometry
11.1 Congruent Triangles, Bisectors & the Projection Rule 11.2 Circle Theorems: Chords, Tangents, Arcs & Segments 11.3 Introduction to Trigonometry
12 Chapter 12: Quantitative Reasoning — Data Interpretation & Word Problems
12.1 Data Interpretation: Tables, Bar Charts, Line Graphs & Pie Charts 12.2 Basic Statistics, Permutations, Combinations & Probability 12.3 Quantitative Word Problems & Age/Coin/Venn Diagram Scenarios
13 Chapter 13: Analytical Reasoning — Fundamentals & Ordering Games
13.1 Analytical Reasoning Framework & Diagramming Notation 13.2 Linear Sequencing, Ranking & Slot-Based Puzzles 13.3 Circular Seating Arrangements & Spatial Relative Puzzles
14 Chapter 14: Analytical Reasoning — Grouping, Selection & Matrix Games
14.1 Grouping, Distribution & Bin-Assignment Puzzles 14.2 Selection Games & Team Formation Constraints 14.3 Attribute Matching & Multi-Dimensional Grid Puzzles
15 Chapter 15: Analytical Reasoning — Critical & Deductive Logic
15.1 Logical Arguments, Premise-Conclusion Structure & Unstated Assumptions 15.2 Strengthening, Weakening & Evaluating Logical Arguments 15.3 Formal Deductions, Syllogisms & Scenario-Based Inferences
16 Chapter 16: Analytical Reasoning — Inductive Logic & Causal Inference
16.1 Inductive Logic, Generalisation & Causal Reasoning
14.1 Grouping, Distribution & Bin-Assignment Puzzles
Key Takeaways Explain This Topic AI
Grouping and bin-assignment puzzles require allocating a fixed set of N entities into K defined or undefined groups subject to operational capacity rules.
Capacity arithmetic establishes minimum and maximum group distribution models before evaluating specific variable pairing constraints.
Block rules ([XY]) mandate entities share a group, while anti-block rules (X ≠ Y) force entities into separate, distinct groups.
Conditional distribution rules (X_1 → Y_2) must be evaluated alongside their contrapositives (~Y_2 → ~X_1) to avoid converse and inverse logic fallacies.
Systematic scenario branching based on multi-slot blocks or highly restricted entities eliminates invalid models rapidly under timed NTS conditions.
Last updated: August 2026
Grouping, Distribution & Bin-Assignment Puzzles
Grouping and distribution puzzles constitute a core pillar of the Analytical Reasoning section in the NTS GAT General examination. Unlike linear ordering games where entities are arranged in a sequential timeline or numerical queue, grouping games require candidates to partition a set of N N N distinct items into K K K predefined groups, categories, teams, or bin slots.
To achieve high efficiency on NTS test day, candidates must develop a disciplined operational workflow: calculating group capacity bounds, translating complex conditional rules into formal logical statements, and identifying forced placements through systematic arithmetic elimination.
1. Core Architecture of Grouping Games
In a standard NTS grouping puzzle, you are presented with three fundamental structural elements:
The Variable Set ( N N N ): The set of distinct entities to be distributed (e.g., 7 research projects: A , B , C , D , E , F , G A, B, C, D, E, F, G A , B , C , D , E , F , G ).
The Categories / Bins ( K K K ): The predefined groups into which entities are partitioned (e.g., 3 university research labs: Lab 1, Lab 2, Lab 3).
Operational Constraints: Rules that dictate group capacities, entity pairings, mutual exclusions, and conditional placement dependencies.
Defined vs. Undefined Grouping Distributions
Grouping games fall into two broad structural categories depending on how group capacities are specified:
Defined Distribution Games: The exact number of elements per group is explicitly fixed in the problem prompt. For example: "7 projects are assigned to 3 labs such that Lab 1 receives 3 projects, Lab 2 receives 2 projects, and Lab 3 receives 2 projects."
Undefined / Variable Distribution Games: The prompt specifies only minimum or maximum capacity bounds, leaving the exact distribution flexible. For example: "7 projects are assigned to 3 labs such that each lab receives at least 1 project, and no lab receives more than 4 projects."
- Structural Property Defined Distribution Undefined / Variable Distribution
- Group Sizes Fixed upfront (e.g., 3, 2, 2) Minimum / Maximum bounds (e.g., Min 1, Max 4)
- Capacity Deduction Immediate (slots pre-allocated) Requires arithmetic partition modeling
- Complexity Level Moderate High
- 2. Group Size Bounds & Capacity Arithmetic
When group capacities are defined by bounds (minimums and maximums), your very first analytical step must be capacity arithmetic . Calculate all allowable numerical distribution splits before evaluating individual variable rules.
Suppose N = 7 N = 7 N = 7 projects are distributed among K = 3 K = 3 K = 3 research labs (Lab 1, Lab 2, Lab 3) under the following capacity rules:
Each lab must receive at least 1 project ( n i ≥ 1 n_i \ge 1 n i ≥ 1 ).
Lab 1 cannot receive more than 2 projects ( 1 ≤ n 1 ≤ 2 1 \le n_1 \le 2 1 ≤ n 1 ≤ 2 ).
Lab 3 must receive at least 3 projects ( n 3 ≥ 3 n_3 \ge 3 n 3 ≥ 3 ).
To find all valid structural distributions, set up the partition sum equation: n 1 + n 2 + n 3 = 7 n_1 + n_2 + n_3 = 7 n 1 + n 2 + n 3 = 7
Given n 1 ∈ { 1 , 2 } n_1 \in \{1, 2\} n 1 ∈ { 1 , 2 } , n 2 ≥ 1 n_2 \ge 1 n 2 ≥ 1 , and n 3 ≥ 3 n_3 \ge 3 n 3 ≥ 3 :
Distribution Model A: n 1 = 1 , n 2 = 3 , n 3 = 3 n_1 = 1, n_2 = 3, n_3 = 3 n 1 = 1 , n 2 = 3 , n 3 = 3 (Sum = 7)
Distribution Model B: n 1 = 1 , n 2 = 2 , n 3 = 4 n_1 = 1, n_2 = 2, n_3 = 4 n 1 = 1 , n 2 = 2 , n 3 = 4 (Sum = 7)
Distribution Model C: n 1 = 2 , n 2 = 1 , n 3 = 4 n_1 = 2, n_2 = 1, n_3 = 4 n 1 = 2 , n 2 = 1 , n 3 = 4 (Sum = 7)
Distribution Model D: n 1 = 2 , n 2 = 2 , n 3 = 3 n_1 = 2, n_2 = 2, n_3 = 3 n 1 = 2 , n 2 = 2 , n 3 = 3 (Sum = 7)
By establishing these four valid models upfront, you deduce critical global facts immediately: Lab 3 always holds at least 3 projects , and Lab 1 never holds more than 2 projects . This restricts where large multi-item blocks can be placed.
3. Rule Formalization: Blocks, Anti-Blocks & Conditionals
Grouping rules describe interactions between entities and groups. Shorthand notation ensures fast, accurate deduction under exam time constraints.
- A. Block Rules (Mandatory Group Sharing)
- Rule: "Project X and Project Y must be assigned to the same lab."
- Shorthand: [ X Y ] [XY] [ X Y ]
Deductive Impact: X X X and Y Y Y function as a single composite unit of size 2. They can only be assigned to labs that have at least 2 open capacity slots.
- B. Anti-Block Rules (Mutual Exclusion)
- Rule: "Project X and Project Y cannot be assigned to the same lab."
- Shorthand: X ≠ Y X \neq Y X = Y
Deductive Impact: X X X and Y Y Y must be split into different labs. If there are only 2 labs total, one lab must take X X X and the other must take Y Y Y .
- C. Conditional Distribution Rules
- Rule: "If Project X is assigned to Lab 1, then Project Y must be assigned to Lab 2."
- Shorthand: X 1 ⟹ Y 2 X_1 \implies Y_2 X 1 ⟹ Y 2
Contrapositive: ¬ Y 2 ⟹ ¬ X 1 \neg Y_2 \implies \neg X_1 ¬ Y 2 ⟹ ¬ X 1 (If Y is NOT in Lab 2, X is NOT in Lab 1) .
Critical NTS Logic Warning: The conditional X 1 ⟹ Y 2 X_1 \implies Y_2 X 1 ⟹ Y 2 provides no information if X X X is not in Lab 1. Y Y Y could still be in Lab 2 or elsewhere. Avoid the converse fallacy ( Y 2 ⟹ X 1 Y_2 \implies X_1 Y 2 ⟹ X 1 ) and inverse fallacy ( ¬ X 1 ⟹ ¬ Y 2 \neg X_1 \implies \neg Y_2 ¬ X 1 ⟹ ¬ Y 2 ).
4. Worked NTS Setup & Step-by-Step Scenario Analysis
Let us work through a complete, exam-style NTS GAT General grouping problem.
Problem Prompt
Seven research projects — A, B, C, D, E, F, G — are assigned to three university research labs: Alpha, Beta, Gamma .
Rule 1: Each project is assigned to exactly one lab.
Rule 2: Alpha must receive exactly 2 projects. Beta must receive at least 2 projects. Gamma must receive at least 2 projects.
Rule 3: Project A must be assigned to Alpha ( A ∈ Alpha A \in \text{Alpha} A ∈ Alpha ).
Rule 4: Project B and Project C must be assigned to the same lab ( [ B C ] [BC] [ BC ] ).
Rule 5: Project D and Project E cannot be assigned to the same lab ( D ≠ E D \neq E D = E ).
Rule 6: If Project F is assigned to Beta, then Project G must be assigned to Gamma ( F Beta ⟹ G Gamma F_{\text{Beta}} \implies G_{\text{Gamma}} F Beta ⟹ G Gamma ).
- Step-by-Step Analytical Execution
- Step 1: Analyze Capacity Distribution
Total projects N = 7 N = 7 N = 7 . Groups K = 3 K = 3 K = 3 .
Alpha: n Alpha = 2 n_{\text{Alpha}} = 2 n Alpha = 2 .
Beta: n Beta ≥ 2 n_{\text{Beta}} \ge 2 n Beta ≥ 2 .
Gamma: n Gamma ≥ 2 n_{\text{Gamma}} \ge 2 n Gamma ≥ 2 .
Since n Alpha + n Beta + n Gamma = 7 n_{\text{Alpha}} + n_{\text{Beta}} + n_{\text{Gamma}} = 7 n Alpha + n Beta + n Gamma = 7 and n Alpha = 2 n_{\text{Alpha}} = 2 n Alpha = 2 : 2 + n Beta + n Gamma = 7 ⟹ n Beta + n Gamma = 5 2 + n_{\text{Beta}} + n_{\text{Gamma}} = 7 \implies n_{\text{Beta}} + n_{\text{Gamma}} = 5 2 + n Beta + n Gamma = 7 ⟹ n Beta + n Gamma = 5
Given n Beta ≥ 2 n_{\text{Beta}} \ge 2 n Beta ≥ 2 and n Gamma ≥ 2 n_{\text{Gamma}} \ge 2 n Gamma ≥ 2 , the only valid size distribution models are:
- Model 1: Alpha = 2, Beta = 3, Gamma = 2
- Model 2: Alpha = 2, Beta = 2, Gamma = 3
- Step 2: Evaluate Fixed Placements and Block Constraints
A ∈ Alpha A \in \text{Alpha} A ∈ Alpha . Since Alpha has a total capacity of 2, Alpha has only 1 remaining open slot .
Block [ B C ] [BC] [ BC ] requires 2 slots in the same lab. Because Alpha has only 1 open slot left, the block [ B C ] [BC] [ BC ] CANNOT be placed in Alpha !
Therefore, [ B C ] [BC] [ BC ] must be assigned to either Beta or Gamma .
- Step 3: Branch into Scenarios Based on [ B C ] [BC] [ BC ] Placement
- Scenario 1: Block [ B C ] [BC] [ BC ] is assigned to Beta ( B , C ∈ Beta B, C \in \text{Beta} B , C ∈ Beta )
Beta currently holds: B , C B, C B , C (2 projects).
From Rule 5 ( D ≠ E D \neq E D = E ), D D D and E E E must be separated.
Evaluate F Beta ⟹ G Gamma F_{\text{Beta}} \implies G_{\text{Gamma}} F Beta ⟹ G Gamma :
If F ∈ Beta F \in \text{Beta} F ∈ Beta , Beta now holds B , C , F B, C, F B , C , F (3 projects). Beta is now FULL under Model 1 (Beta=3, Gamma=2).
Then Gamma must hold 2 projects, and Alpha holds 2 projects ( A A A and one of D / E D/E D / E ).
Rule 6 requires G ∈ Gamma G \in \text{Gamma} G ∈ Gamma .
Suppose Alpha takes D D D ( A , D ∈ Alpha A, D \in \text{Alpha} A , D ∈ Alpha ). Then Alpha is FULL.
Gamma must take E E E and G G G ( E , G ∈ Gamma E, G \in \text{Gamma} E , G ∈ Gamma ). Gamma now has 2 projects.
Let us verify this configuration: Alpha={A, D}, Beta={B, C, F}, Gamma={E, G}.
Size check: Alpha=2, Beta=3, Gamma=2 (Sum=7). Valid!
Rule 3: A ∈ Alpha A \in \text{Alpha} A ∈ Alpha . Valid!
Rule 4: [ B C ] ∈ Beta [BC] \in \text{Beta} [ BC ] ∈ Beta . Valid!
Rule 5: D ∈ Alpha , E ∈ Gamma ⟹ D ≠ E D \in \text{Alpha}, E \in \text{Gamma} \implies D \neq E D ∈ Alpha , E ∈ Gamma ⟹ D = E . Valid!
Rule 6: F ∈ Beta ⟹ G ∈ Gamma F \in \text{Beta} \implies G \in \text{Gamma} F ∈ Beta ⟹ G ∈ Gamma . Valid!
Result: Configuration 1 is fully valid!
Scenario 2: Block [ B C ] [BC] [ BC ] is assigned to Gamma ( B , C ∈ Gamma B, C \in \text{Gamma} B , C ∈ Gamma )
Gamma currently holds: B , C B, C B , C (2 projects).
If Model 2 applies (Alpha=2, Beta=2, Gamma=3), Gamma has 1 remaining open slot, Alpha has 1 open slot ( A A A is already there), and Beta has 2 open slots.
Place D D D in Alpha ( A , D ∈ Alpha A, D \in \text{Alpha} A , D ∈ Alpha ). Alpha is FULL.
Place E E E in Beta ( E ∈ Beta E \in \text{Beta} E ∈ Beta ).
Place F F F in Beta ( F ∈ Beta F \in \text{Beta} F ∈ Beta ). Beta now has { E , F } \{E, F\} { E , F } (2 projects). Beta is FULL.
Place G G G in Gamma ( B , C , G ∈ Gamma B, C, G \in \text{Gamma} B , C , G ∈ Gamma ). Gamma has 3 projects. Gamma is FULL.
Check Rule 6: F ∈ Beta ⟹ G ∈ Gamma F \in \text{Beta} \implies G \in \text{Gamma} F ∈ Beta ⟹ G ∈ Gamma . Since G ∈ Gamma G \in \text{Gamma} G ∈ Gamma , Rule 6 is satisfied!
Let us verify Configuration 2: Alpha={A, D}, Beta={E, F}, Gamma={B, C, G}.
Size check: Alpha=2, Beta=2, Gamma=3 (Sum=7). Valid!
Rule 3: A ∈ Alpha A \in \text{Alpha} A ∈ Alpha . Valid!
Rule 4: [ B C ] ∈ Gamma [BC] \in \text{Gamma} [ BC ] ∈ Gamma . Valid!
Rule 5: D ∈ Alpha , E ∈ Beta ⟹ D ≠ E D \in \text{Alpha}, E \in \text{Beta} \implies D \neq E D ∈ Alpha , E ∈ Beta ⟹ D = E . Valid!
Rule 6: F ∈ Beta ⟹ G ∈ Gamma F \in \text{Beta} \implies G \in \text{Gamma} F ∈ Beta ⟹ G ∈ Gamma . Valid!
Result: Configuration 2 is fully valid!
5. Summary of Valid Configurations
- Configuration Alpha (Cap 2) Beta (Cap 2-3) Gamma (Cap 2-3) Model Breakdown
- Config 1 A, D B, C, F E, G Alpha=2, Beta=3, Gamma=2
- Config 2 A, D E, F B, C, G Alpha=2, Beta=2, Gamma=3
- Config 3 A, E B, C, F D, G Alpha=2, Beta=3, Gamma=2
- Config 4 A, E D, F B, C, G Alpha=2, Beta=2, Gamma=3
Mastering this systematic breakdown allows you to answer any individual question in an NTS Analytical Reasoning set in under 30 seconds.