14.1 Grouping, Distribution & Bin-Assignment Puzzles

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$ distinct items into $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:

1. The Variable Set ($N$): The set of distinct entities to be distributed (e.g., 7 research projects: $A, B, C, D, E, F, G$).
2. The Categories / Bins ($K$): The predefined groups into which entities are partitioned (e.g., 3 university research labs: Lab 1, Lab 2, Lab 3).
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."

---

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$ projects are distributed among $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 \ge 1$).
• Lab 1 cannot receive more than 2 projects ($1 \le n_1 \le 2$).
• Lab 3 must receive at least 3 projects ($n_3 \ge 3$).

To find all valid structural distributions, set up the partition sum equation: $n_1 + n_2 + n_3 = 7$ Given $n_1 \in {1, 2}$, $n_2 \ge 1$, and $n_3 \ge 3$:

• Distribution Model A: $n_1 = 1, n_2 = 3, n_3 = 3$ (Sum = 7)
• Distribution Model B: $n_1 = 1, n_2 = 2, n_3 = 4$ (Sum = 7)
• Distribution Model C: $n_1 = 2, n_2 = 1, n_3 = 4$ (Sum = 7)
• Distribution Model D: $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: $[XY]$
• Deductive Impact: $X$ and $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 \neq Y$
• Deductive Impact: $X$ and $Y$ must be split into different labs. If there are only 2 labs total, one lab must take $X$ and the other must take $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 \implies Y_2$
• Contrapositive: $\neg Y_2 \implies \neg X_1$ (If Y is NOT in Lab 2, X is NOT in Lab 1).

Critical NTS Logic Warning: The conditional $X_1 \implies Y_2$ provides no information if $X$ is not in Lab 1. $Y$ could still be in Lab 2 or elsewhere. Avoid the converse fallacy ($Y_2 \implies X_1$) and inverse fallacy ($\neg X_1 \implies \neg 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 \in \text{Alpha}$).
• Rule 4: Project B and Project C must be assigned to the same lab ($[BC]$).
• Rule 5: Project D and Project E cannot be assigned to the same lab ($D \neq E$).
• Rule 6: If Project F is assigned to Beta, then Project G must be assigned to Gamma ($F_{\text{Beta}} \implies G_{\text{Gamma}}$).

---

Step-by-Step Analytical Execution

Step 1: Analyze Capacity Distribution

Total projects $N = 7$. Groups $K = 3$.

• Alpha: $n_{\text{Alpha}} = 2$.
• Beta: $n_{\text{Beta}} \ge 2$.
• Gamma: $n_{\text{Gamma}} \ge 2$.

Since $n_{\text{Alpha}} + n_{\text{Beta}} + n_{\text{Gamma}} = 7$ and $n_{\text{Alpha}} = 2$: $2 + n_{\text{Beta}} + n_{\text{Gamma}} = 7 \implies n_{\text{Beta}} + n_{\text{Gamma}} = 5$ Given $n_{\text{Beta}} \ge 2$ and $n_{\text{Gamma}} \ge 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 \in \text{Alpha}$. Since Alpha has a total capacity of 2, Alpha has only 1 remaining open slot.
• Block $[BC]$ requires 2 slots in the same lab. Because Alpha has only 1 open slot left, the block $[BC]$ CANNOT be placed in Alpha!
• Therefore, $[BC]$ must be assigned to either Beta or Gamma.

Step 3: Branch into Scenarios Based on $[BC]$ Placement

Scenario 1: Block $[BC]$ is assigned to Beta ($B, C \in \text{Beta}$)

• Beta currently holds: $B, C$ (2 projects).
• From Rule 5 ($D \neq E$), $D$ and $E$ must be separated.
• Evaluate $F_{\text{Beta}} \implies G_{\text{Gamma}}$:
  • If $F \in \text{Beta}$, Beta now holds $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$ and one of $D/E$).
  • Rule 6 requires $G \in \text{Gamma}$.
  • Suppose Alpha takes $D$ ($A, D \in \text{Alpha}$). Then Alpha is FULL.
  • Gamma must take $E$ and $G$ ($E, G \in \text{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 \in \text{Alpha}$. Valid!
    • Rule 4: $[BC] \in \text{Beta}$. Valid!
    • Rule 5: $D \in \text{Alpha}, E \in \text{Gamma} \implies D \neq E$. Valid!
    • Rule 6: $F \in \text{Beta} \implies G \in \text{Gamma}$. Valid!
  • Result: Configuration 1 is fully valid!

Scenario 2: Block $[BC]$ is assigned to Gamma ($B, C \in \text{Gamma}$)

• Gamma currently holds: $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$ is already there), and Beta has 2 open slots.
• Place $D$ in Alpha ($A, D \in \text{Alpha}$). Alpha is FULL.
• Place $E$ in Beta ($E \in \text{Beta}$).
• Place $F$ in Beta ($F \in \text{Beta}$). Beta now has ${E, F}$ (2 projects). Beta is FULL.
• Place $G$ in Gamma ($B, C, G \in \text{Gamma}$). Gamma has 3 projects. Gamma is FULL.
• Check Rule 6: $F \in \text{Beta} \implies G \in \text{Gamma}$. Since $G \in \text{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 \in \text{Alpha}$. Valid!
  • Rule 4: $[BC] \in \text{Gamma}$. Valid!
  • Rule 5: $D \in \text{Alpha}, E \in \text{Beta} \implies D \neq E$. Valid!
  • Rule 6: $F \in \text{Beta} \implies G \in \text{Gamma}$. Valid!
• Result: Configuration 2 is fully valid!

---

5. Summary of Valid Configurations

Mastering this systematic breakdown allows you to answer any individual question in an NTS Analytical Reasoning set in under 30 seconds.