14.2 Selection Games & Team Formation Constraints

Selection Games & Team Formation Constraints

Selection games — frequently referred to as In/Out Games — represent a standard and highly scoring question type in the NTS GAT General Analytical Reasoning section. While grouping games involve partitioning all available entities among multiple categories, selection games focus on choosing a specific subset of $k$ candidates from a larger pool of $N$ candidates to form a single committee, team, panel, or board.

In these games, candidates who are selected are placed in the IN group, while candidates who are rejected fall into the OUT group. High performance requires systematic tracking of conditional requirements, mutual exclusions, and contrapositive chains.

---

1. The Three Fundamental Conditional Selection Rules

Every conditional rule in a selection game can be classified into one of three structural patterns. Mastering their formal representations and contrapositives is essential for building error-free logic chains.

1. Requirement Rule:         X  ──>  Y      (Contrapositive:  ~Y ──> ~X)
2. Exclusion Rule:           A  ──> ~B      (Contrapositive:   B ──> ~A)
3. Mandatory Inclusion Rule: ~C  ──>  D      (Contrapositive:  ~D ──>  C)

Pattern 1: Sufficient Requirement ($X \implies Y$)

• Statement: "If Candidate X is selected, then Candidate Y must be selected."
• Formal Symbol: $X \in \text{IN} \implies Y \in \text{IN}$
• Contrapositive: $Y \in \text{OUT} \implies X \in \text{OUT}$
• Deductive Meaning: Selecting $X$ forces $Y$ to be IN. However, $Y$ can be selected without $X$, and both $X$ and $Y$ can be OUT together.

Pattern 2: Mutual Exclusion ($A \implies \neg B$)

• Statement: "Candidate A and Candidate B cannot both be selected." (Or "If A is selected, B is not selected.")
• Formal Symbol: $A \in \text{IN} \implies B \in \text{OUT}$
• Contrapositive: $B \in \text{IN} \implies A \in \text{OUT}$
• Deductive Meaning: At most one of ${A, B}$ can be IN. They can never both be IN. However, both $A$ and $B$ can be OUT simultaneously.

Pattern 3: Mandatory Inclusion / At-Least-One ($\neg C \implies D$)

• Statement: "If Candidate C is not selected, then Candidate D must be selected." (Or "At least one of C or D must be selected.")
• Formal Symbol: $C \in \text{OUT} \implies D \in \text{IN}$
• Contrapositive: $D \in \text{OUT} \implies C \in \text{IN}$
• Deductive Meaning: At least one of ${C, D}$ must be IN. They can never both be OUT. They can both be IN simultaneously.

---

2. Constructing Integrated Logic Chains

When a selection game presents multiple conditional rules, combine them into a single continuous Logic Chain. Combining statements allows you to deduce long domino effects from a single selection choice.

Suppose a puzzle provides the following three rules:

1. $P \implies Q$
2. $Q \implies \neg R$
3. $\neg S \implies R$

Step A: Find the Contrapositive of Each Rule

1. $\neg Q \implies \neg P$
2. $R \implies \neg Q$
3. $\neg R \implies S$

Step B: Link Direct Rules and Contrapositives

• Direct Chain: $P \implies Q \implies \neg R \implies S$ (If P is IN, then Q is IN, R is OUT, and S is IN!)
• Contrapositive Chain: $\neg S \implies R \implies \neg Q \implies \neg P$ (If S is OUT, then R is IN, Q is OUT, and P is OUT!)

By linking these rules upfront, selecting $P$ immediately resolves four variables at once ($P \in \text{IN}, Q \in \text{IN}, R \in \text{OUT}, S \in \text{IN}$).

---

3. Worked NTS Delegation Selection Problem

Let us apply this logic to a comprehensive NTS-style committee selection problem.

Problem Prompt

A 4-member delegation must be selected from a pool of 7 candidates: P, Q, R, S, T, U, V.

• Rule 1: Exactly 4 candidates must be selected (IN = 4, OUT = 3).
• Rule 2: If P is selected, Q must be selected ($P \implies Q$).
• Rule 3: Candidate R and Candidate S cannot both be selected ($R \implies \neg S$).
• Rule 4: If T is not selected, U must be selected ($\neg T \implies U$).
• Rule 5: Candidate V is selected only if Candidate R is selected ($V \implies R$).
• Rule 6: Candidate S is selected ($S \in \text{IN}$).

---

Step-by-Step Analytical Solution

Step 1: Formalize Rules and Contrapositives

• Rule 2: $P \implies Q$ | Contrapositive: $\neg Q \implies \neg P$
• Rule 3: $R \implies \neg S$ | Contrapositive: $S \implies \neg R$
• Rule 4: $\neg T \implies U$ | Contrapositive: $\neg U \implies T$
• Rule 5: $V \implies R$ | Contrapositive: $\neg R \implies \neg V$
• Rule 6: $S \in \text{IN}$

Step 2: Process the Given Fact ($S \in \text{IN}$)

• Place $S$ into the IN column: $\text{IN} = {S, \dots}$.
• Apply Rule 3 contrapositive ($S \implies \neg R$): Since $S$ is IN, R must be OUT.
• Place $R$ into the OUT column: $\text{OUT} = {R, \dots}$.
• Apply Rule 5 contrapositive ($\neg R \implies \neg V$): Since $R$ is OUT, V must be OUT.
• Place $V$ into the OUT column: $\text{OUT} = {R, V, \dots}$.

Step 3: Utilize Capacity Limits

• Total candidates = 7. Selected (IN) = 4. Unselected (OUT) = 3.
• We have already placed 2 candidates into OUT: $\text{OUT} = {R, V}$.
• Therefore, only 1 remaining candidate can be placed in OUT!
• Consequently, at least 3 of the remaining candidates {P, Q, T, U} MUST be placed in IN.

Step 4: Test Remaining Candidates {P, Q, T, U}

• Evaluate Rule 4 ($\neg T \implies U$): Can both $T$ and $U$ be OUT? No, because we only have 1 open slot in OUT, and Rule 4 forbids both $T$ and $U$ from being OUT. Thus, at least one of ${T, U}$ is IN.

• Evaluate Rule 2 ($P \implies Q$): Suppose $P$ is OUT. Then $\text{OUT} = {R, V, P}$.

  • This fills the OUT group completely (3 items: $R, V, P$).
  • Therefore, all remaining candidates ($Q, T, U$) MUST be IN!
  • Check if $\text{IN} = {S, Q, T, U}$ satisfies all rules:
    • Rule 1: Size is 4. (Pass)
    • Rule 2: $P \implies Q$ is vacuously true since $P \notin \text{IN}$. (Pass)
    • Rule 3: $R \in \text{OUT}, S \in \text{IN}$. (Pass)
    • Rule 4: Both $T$ and $U$ are IN, satisfying $\neg T \implies U$. (Pass)
    • Rule 5: $V \in \text{OUT}, R \in \text{OUT}$. (Pass)
  • Valid Delegation 1: ${S, Q, T, U}$

• Now suppose $P$ is IN:

  • By Rule 2 ($P \implies Q$), $Q$ MUST also be IN.
  • So $\text{IN}$ contains ${S, P, Q}$ (3 members).
  • The 4th member of IN must be either $T$ or $U$ (since OUT has 1 slot left for the other).
  • If $T$ is IN and $U$ is OUT: $\text{IN} = {S, P, Q, T}$ and $\text{OUT} = {R, V, U}$. Valid!
  • If $U$ is IN and $T$ is OUT: $\text{IN} = {S, P, Q, U}$ and $\text{OUT} = {R, V, T}$. Valid!

---

Selection Breakdown Table