Study guide

14.2 Selection Games & Team Formation Constraints

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.2 Selection Games & Team Formation Constraints

Key Takeaways Explain This Topic AI

Selection games (In/Out games) require choosing a subset of size k from N candidates, partitioning entities into selected (IN) and unselected (OUT) groups.

Conditional selection rules fall into three core patterns: Requirements (X → Y), Exclusions (A → ~B), and Mandatory Inclusions (~C → D).

Constructing linked logic chains of direct rules and contrapositives enables multi-variable domino deductions from a single candidate placement.

Numerical bounds on team capacity restrict candidate combinations and accelerate the elimination of invalid selection sets.

Maintaining dual scratchpad columns for IN and OUT candidates prevents selection errors under exam conditions.

Last updated: August 2026

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 k k candidates from a larger pool of N N 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 ⟹ Y X \implies Y X ⟹ Y )
  • Statement: "If Candidate X is selected, then Candidate Y must be selected."
  • Formal Symbol: X ∈ IN ⟹ Y ∈ IN X \in \text{IN} \implies Y \in \text{IN} X ∈ IN ⟹ Y ∈ IN
  • Contrapositive: Y ∈ OUT ⟹ X ∈ OUT Y \in \text{OUT} \implies X \in \text{OUT} Y ∈ OUT ⟹ X ∈ OUT

Deductive Meaning: Selecting X X X forces Y Y Y to be IN. However, Y Y Y can be selected without X X X , and both X X X and Y Y Y can be OUT together.

  • Pattern 2: Mutual Exclusion ( A ⟹ ¬ B A \implies \neg B A ⟹ ¬ B )
  • Statement: "Candidate A and Candidate B cannot both be selected." (Or "If A is selected, B is not selected." )
  • Formal Symbol: A ∈ IN ⟹ B ∈ OUT A \in \text{IN} \implies B \in \text{OUT} A ∈ IN ⟹ B ∈ OUT
  • Contrapositive: B ∈ IN ⟹ A ∈ OUT B \in \text{IN} \implies A \in \text{OUT} B ∈ IN ⟹ A ∈ OUT

Deductive Meaning: At most one of { A , B } \{A, B\} { A , B } can be IN. They can never both be IN. However, both A A A and B B B can be OUT simultaneously.

Pattern 3: Mandatory Inclusion / At-Least-One ( ¬ C ⟹ D \neg C \implies D ¬ C ⟹ 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 ∈ OUT ⟹ D ∈ IN C \in \text{OUT} \implies D \in \text{IN} C ∈ OUT ⟹ D ∈ IN
  • Contrapositive: D ∈ OUT ⟹ C ∈ IN D \in \text{OUT} \implies C \in \text{IN} D ∈ OUT ⟹ C ∈ IN

Deductive Meaning: At least one of { C , D } \{C, D\} { C , D } must be IN. They can never both be OUT. They can both be IN simultaneously.

Rule Type If First Element is IN If First Element is OUT Can Both Be IN? Can Both Be OUT?

  • Requirement ( X ⟹ Y X \implies Y X ⟹ Y ) Y Y Y must be IN No inference on Y Y Y Yes Yes
  • Exclusion ( A ⟹ ¬ B A \implies \neg B A ⟹ ¬ B ) B B B must be OUT No inference on B B B NO Yes
  • Inclusion ( ¬ C ⟹ D \neg C \implies D ¬ C ⟹ D ) No inference on D D D D D D must be IN Yes NO
  • 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:

  • P ⟹ Q P \implies Q P ⟹ Q
  • Q ⟹ ¬ R Q \implies \neg R Q ⟹ ¬ R
  • ¬ S ⟹ R \neg S \implies R ¬ S ⟹ R
  • Step A: Find the Contrapositive of Each Rule
  • ¬ Q ⟹ ¬ P \neg Q \implies \neg P ¬ Q ⟹ ¬ P
  • R ⟹ ¬ Q R \implies \neg Q R ⟹ ¬ Q
  • ¬ R ⟹ S \neg R \implies S ¬ R ⟹ S
  • Step B: Link Direct Rules and Contrapositives

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

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

By linking these rules upfront, selecting P P P immediately resolves four variables at once ( P ∈ IN , Q ∈ IN , R ∈ OUT , S ∈ IN P \in \text{IN}, Q \in \text{IN}, R \in \text{OUT}, S \in \text{IN} P ∈ IN , Q ∈ IN , R ∈ OUT , S ∈ 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 ⟹ Q P \implies Q P ⟹ Q ).

Rule 3: Candidate R and Candidate S cannot both be selected ( R ⟹ ¬ S R \implies \neg S R ⟹ ¬ S ).

Rule 4: If T is not selected, U must be selected ( ¬ T ⟹ U \neg T \implies U ¬ T ⟹ U ).

Rule 5: Candidate V is selected only if Candidate R is selected ( V ⟹ R V \implies R V ⟹ R ).

Rule 6: Candidate S is selected ( S ∈ IN S \in \text{IN} S ∈ IN ).

  • Step-by-Step Analytical Solution
  • Step 1: Formalize Rules and Contrapositives
  • Rule 2: P ⟹ Q P \implies Q P ⟹ Q | Contrapositive: ¬ Q ⟹ ¬ P \neg Q \implies \neg P ¬ Q ⟹ ¬ P
  • Rule 3: R ⟹ ¬ S R \implies \neg S R ⟹ ¬ S | Contrapositive: S ⟹ ¬ R S \implies \neg R S ⟹ ¬ R
  • Rule 4: ¬ T ⟹ U \neg T \implies U ¬ T ⟹ U | Contrapositive: ¬ U ⟹ T \neg U \implies T ¬ U ⟹ T
  • Rule 5: V ⟹ R V \implies R V ⟹ R | Contrapositive: ¬ R ⟹ ¬ V \neg R \implies \neg V ¬ R ⟹ ¬ V
  • Rule 6: S ∈ IN S \in \text{IN} S ∈ IN
  • Step 2: Process the Given Fact ( S ∈ IN S \in \text{IN} S ∈ IN )

Place S S S into the IN column: IN = { S , … } \text{IN} = \{S, \dots\} IN = { S , … } .

Apply Rule 3 contrapositive ( S ⟹ ¬ R S \implies \neg R S ⟹ ¬ R ): Since S S S is IN, R must be OUT .

Place R R R into the OUT column: OUT = { R , … } \text{OUT} = \{R, \dots\} OUT = { R , … } .

Apply Rule 5 contrapositive ( ¬ R ⟹ ¬ V \neg R \implies \neg V ¬ R ⟹ ¬ V ): Since R R R is OUT, V must be OUT .

Place V V V into the OUT column: OUT = { R , V , … } \text{OUT} = \{R, V, \dots\} OUT = { R , V , … } .

Step 3: Utilize Capacity Limits

Total candidates = 7. Selected (IN) = 4. Unselected (OUT) = 3.

We have already placed 2 candidates into OUT: OUT = { R , V } \text{OUT} = \{R, V\} 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 ( ¬ T ⟹ U \neg T \implies U ¬ T ⟹ U ): Can both T T T and U U U be OUT? No, because we only have 1 open slot in OUT, and Rule 4 forbids both T T T and U U U from being OUT. Thus, at least one of { T , U } \{T, U\} { T , U } is IN.

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

This fills the OUT group completely (3 items: R , V , P R, V, P R , V , P ).

Therefore, all remaining candidates ( Q , T , U Q, T, U Q , T , U ) MUST be IN!

Check if IN = { S , Q , T , U } \text{IN} = \{S, Q, T, U\} IN = { S , Q , T , U } satisfies all rules:

  • Rule 1: Size is 4. (Pass)
  • Rule 2: P ⟹ Q P \implies Q P ⟹ Q is vacuously true since P ∉ IN P \notin \text{IN} P ∈ / IN . (Pass)
  • Rule 3: R ∈ OUT , S ∈ IN R \in \text{OUT}, S \in \text{IN} R ∈ OUT , S ∈ IN . (Pass)
  • Rule 4: Both T T T and U U U are IN, satisfying ¬ T ⟹ U \neg T \implies U ¬ T ⟹ U . (Pass)
  • Rule 5: V ∈ OUT , R ∈ OUT V \in \text{OUT}, R \in \text{OUT} V ∈ OUT , R ∈ OUT . (Pass)
  • Valid Delegation 1: { S , Q , T , U } \{S, Q, T, U\} { S , Q , T , U }

Now suppose P P P is IN:

By Rule 2 ( P ⟹ Q P \implies Q P ⟹ Q ), Q Q Q MUST also be IN.

So IN \text{IN} IN contains { S , P , Q } \{S, P, Q\} { S , P , Q } (3 members).

The 4th member of IN must be either T T T or U U U (since OUT has 1 slot left for the other).

If T T T is IN and U U U is OUT: IN = { S , P , Q , T } \text{IN} = \{S, P, Q, T\} IN = { S , P , Q , T } and OUT = { R , V , U } \text{OUT} = \{R, V, U\} OUT = { R , V , U } . Valid!

If U U U is IN and T T T is OUT: IN = { S , P , Q , U } \text{IN} = \{S, P, Q, U\} IN = { S , P , Q , U } and OUT = { R , V , T } \text{OUT} = \{R, V, T\} OUT = { R , V , T } . Valid!

Selection Breakdown Table

  • Option Set Selected Members (IN) Rejected Candidates (OUT) Validity Status
  • Set 1 S, Q, T, U R, V, P ✅ Valid
  • Set 2 S, P, Q, T R, V, U ✅ Valid
  • Set 3 S, P, Q, U R, V, T ✅ Valid
  • Any with R Includes R Excludes S or V ❌ Invalid (S is forced IN)

Loading diagram... Selection Rule Logic Chains & Contrapositive Links