4.4 Analytical Puzzles, Linear Ordering, and Grouping

4.4 Analytical Puzzles, Linear Ordering, and Grouping

Analytical puzzles assess your capacity to synthesize multiple simultaneous constraints and infer unstated spatial, temporal, or categorical relationships. BEA does not publish a time limit per item, so practise until each puzzle type feels routine. Success requires structured diagramming frameworks tailored to the three primary puzzle archetypes:

1. Linear Ordering and Sequential Scheduling (1-dimensional spatial or chronological rankings)
2. Matrix Logic and Multi-Variable Matching (cross-attribute matching between people, tracks, and locations)
3. Grouping, Selection, and Team Assembly (sub-roster filtering under conditional and mutual exclusion rules)

---

Linear Ordering and Sequential Scheduling

Linear ordering puzzles require placing a fixed set of entities (such as student speakers, laboratory presentation slots, runners finishing a race, or floors in a school building) into an ordered sequence from $1$ to $N$.

Setting Up the Base Diagram

Always draw a simple row of numbered slots representing the sequence: $\underline{\quad 1 \quad} \quad \underline{\quad 2 \quad} \quad \underline{\quad 3 \quad} \quad \underline{\quad 4 \quad} \quad \underline{\quad 5 \quad} \quad \underline{\quad 6 \quad}$

Standard Shorthand for Linear Constraints

Translate the narrative rules into concise spatial symbols:

• Relative Order ($A > B$ or $A \dots B$): $A$ appears earlier than $B$ (does not necessarily mean immediately before; there could be intermediate entities).
• Immediate Adjacency Block ($[A B]$): $A$ appears immediately before $B$. They form an indivisible two-slot block.
• Reversible Adjacency ($[A / B]$): $A$ and $B$ are adjacent in either order ($[A B]$ or $[B A]$).
• Fixed Spacing ($A \underline{\hspace{0.5cm}} B$): Exactly one entity separates $A$ and $B$.
• Positional Exclusions ($A \neq 1$, $B \neq 6$): $A$ cannot occupy the first position; $B$ cannot occupy the last position.
• Absolute Anchor ($C = 3$): $C$ is permanently fixed in slot 3.

The "Split the Board" (Dual Scenario) Strategy

When a major entity or block has only two possible valid locations, do not try to hold both in your head. Immediately sketch two parallel base diagrams:

• Scenario 1: Place the entity in its first possible position and track the cascading deductions.
• Scenario 2: Place the entity in its second possible position and track deductions. Often, one scenario quickly leads to a contradiction, instantly leaving the other scenario as the definitive solution.

---

Matrix Logic and Cross-Variable Elimination Grids

Matrix puzzles require matching elements from two or three distinct categories—for instance, four students ($P, Q, R, S$), four Academic Track elective clusters (STEM; Business and Entrepreneurship, B&E; Arts, Social Sciences, and Humanities, ASSH; and Sports, Health, and Wellness, SHW), and four hometown provinces (Pampanga, Batangas, Iloilo, Davao).

Constructing the Logic Grid

For a two-variable puzzle, draw a grid with entities on the vertical axis and attributes on the horizontal axis. For three-variable puzzles, construct an L-shaped logic grid linking Category A to Category B, Category B to Category C, and Category A to Category C.

                  [ Elective Clusters ]
                  STEM   B&E   ASSH   SHW
Andres    |        |  X  |       |        |
Bea       |   X    |     |   X   |   X    |  <-- Bea is B&E!
Carlo     |        |  X  |       |        |
Dalia     |        |  X  |       |        |

Execution Rules for Matrix Elimination

1. The Positive Match Rule: When a positive link is confirmed ($A$ is assigned to $B$), place a checkmark ($\checkmark$). Immediately place an '$\times$' across all other cells in that same row and that same column. (Each person has only one cluster, and each cluster belongs to only one person).
2. The Negative Match Rule: When a clue explicitly separates two elements ("Andres is not in B&E"), place an '$\times$' in that intersection.
3. Transitive Transfer Across Grid Planes: If you learn that Andres is from Pampanga and the grid confirms that the student from Pampanga is in STEM, you can immediately deduce that Andres is in STEM.

---

Grouping, Selection, and Committee Formation

Grouping puzzles present a pool of candidates from which a smaller delegation or committee must be selected, or assign candidates into multiple teams (e.g., Team Blue vs. Team Gold).

Structural Constraints

1. Pool Size and Target Quota: Total candidates $N$ (e.g., 7 students), target subgroup size $k$ (e.g., select exactly 4 students).
2. Roster Organization: Always maintain two visible columns on your scratchpad: IN (Selected) and OUT (Excluded).

Formalizing Conditional Grouping Rules

• Sufficient Selection ($A \rightarrow B$): If $A$ is selected, $B$ must also be selected.
  • Contrapositive Link: If $B$ is not selected, $A$ cannot be selected ($\neg B \rightarrow \neg A$).
  • Note: $B$ can be selected without $A$.
• Mutually Exclusive Selection ($A \rightarrow \neg B$): $A$ and $B$ cannot both be selected. At least one must be excluded (they can both be excluded unless a minimum quota forces one in).
• Conjoined Selection ($A \leftrightarrow B$): Either both $A$ and $B$ are selected together, or neither is selected ($A$ and $B$ are inseparable).
• Binary Sub-Group Requirement (Exactly One): Exactly one of $C$ or $D$ must be selected ($C \text{ XOR } D$). This accounts for exactly one slot in the IN group and one slot in the OUT group.

---

Rapid Diagnostic Strategies for Computer-Based Testing

When under time pressure during the examination, deploy these proven test-taking tactics:

1. The Rule-Elimination Shortcut for "Acceptable Arrangement" Questions

Frequently, the very first question accompanying a puzzle asks: "Which of the following represents an acceptable schedule/team?"

• Do NOT build a full diagram from scratch to answer this question.
• Instead, take one rule from the prompt at a time and scan down all four options.
• Cross out any option that violates that specific rule.
• Move to the next rule and repeat. You will eliminate three incorrect options in 15 to 20 seconds without ever constructing a diagram!

2. Prioritizing the "Most Restrictive Constraint"

When constructing your diagram, always process clues in order of restrictiveness rather than chronological reading order:

• First: Concrete anchors (e.g., "Evelyn presents in Slot 4").
• Second: Large multi-element blocks (e.g., "Antonio presents immediately before Beatrice").
• Third: Relational limits and exclusions (e.g., "Dante presents before Clarissa; Clarissa is not last").

3. Local vs. Global Questions

• Global Questions ("Which of the following must be true in any valid schedule?"): These truths hold across all possible solutions and are derived directly from your base diagram deductions.
• Local Questions ("If Dante presents in Slot 5, which student must present in Slot 2?"): This condition applies strictly to this single question. Jot down a quick scratchpad branch for this specific scenario; never erase or permanently overwrite your primary base diagram.

---

Step-by-Step Worked Analytical Setups

Worked Problem 1: Linear Sequencing of Research Presentations

Setup: Six senior high school students—Antonio, Beatrice, Clarissa, Dante, Evelyn, and Felix—are scheduled to deliver oral research presentations from Slot 1 through Slot 6 under the following conditions:

1. Dante presents earlier than Clarissa ($D < C$).
2. Antonio presents immediately before Beatrice ($[A B]$).
3. Evelyn must present in Slot 4 ($E = 4$).
4. Felix must present in either Slot 1 or Slot 6 ($F = 1 \lor F = 6$).

Question: If Felix presents in Slot 1 and Dante presents in Slot 5, in which slot must Antonio present?

Step-by-Step Deduction:

1. Set up the base slots: $\underline{\quad 1 \quad} \quad \underline{\quad 2 \quad} \quad \underline{\quad 3 \quad} \quad \underline{\quad 4 \quad} \quad \underline{\quad 5 \quad} \quad \underline{\quad 6 \quad}$
2. Incorporate the specific conditions provided by the question:
   • Slot 1 = Felix ($F = 1$)
   • Slot 4 = Evelyn ($E = 4$, from Rule 3)
   • Slot 5 = Dante ($D = 5$)
   • Current grid state: $\underline{\; F \;} \quad \underline{\quad 2 \quad} \quad \underline{\quad 3 \quad} \quad \underline{\; E \;} \quad \underline{\; D \;} \quad \underline{\quad 6 \quad}$
3. Analyze remaining open slots: Slots 2, 3, and 6 are open. Candidates to place: Antonio, Beatrice, Clarissa.
4. Apply Rule 2 (Adjacency Block $[A B]$):
   • Antonio and Beatrice must occupy two adjacent consecutive slots.
   • Slot 6 is isolated between Dante (Slot 5) and the end of the line. Thus, the $[A B]$ block cannot fit in Slot 6.
   • The only consecutive open slots available are Slots 2 and 3.
   • Therefore, Antonio must present in Slot 2, and Beatrice must present in Slot 3.
5. Place the final candidate: Clarissa must occupy the remaining open slot: Slot 6.
6. Verify Rule 1 ($D < C$): Dante is in Slot 5 and Clarissa is in Slot 6 ($5 < 6$). The rule is completely satisfied!
7. Conclusion: Antonio must present in Slot 2.

Worked Problem 2: Committee Selection Under Conditional Rules

Setup: A science club must select exactly 4 delegates from a candidate pool of 6 students: Paul, Queenie, Renz, Sara, Teresa, and Victor. The selection must satisfy these rules:

1. If Paul is selected, Queenie cannot be selected ($P \rightarrow \neg Q$).
2. If Renz is selected, Teresa must also be selected ($R \rightarrow T$).
3. Exactly one of Sara or Victor must be selected, but not both ($S \text{ XOR } V$).
4. Queenie is selected as the head of delegation.

Question: Given that Queenie is selected, who must be in the delegation?

Step-by-Step Deduction:

1. Anchor the given condition: Queenie is IN (Slot 1 of 4).
2. Apply Rule 1 ($P \rightarrow \neg Q$):
   • The contrapositive of Rule 1 is: If Queenie is selected, Paul cannot be selected ($Q \rightarrow \neg P$).
   • Since Queenie is IN, Paul is permanently OUT.
3. Analyze candidate availability: Candidates remaining to fill 3 spots: Renz, Sara, Teresa, Victor.
4. Apply Rule 3 (Binary Choice between Sara and Victor):
   • Exactly one of $\{S, V\}$ must be IN, and exactly one must be OUT.
   • This uses up exactly 1 spot in our 4-member delegation.
5. Calculate remaining quota:
   • We have 4 total spots: Queenie (1) + One of $\{S, V\}$ (1) = 2 spots filled.
   • We need exactly 2 more delegates to reach the target quota of 4.
   • Who remains from the candidate pool? Only Renz and Teresa!
   • Therefore, both Renz and Teresa must be selected.
6. Verify Rule 2 ($R \rightarrow T$):
   • Since Renz is selected, Teresa must be selected. Both are in the delegation, so Rule 2 is perfectly satisfied.
7. Final Delegation Composition: Queenie, Renz, Teresa, and either Sara or Victor.