5.3 Relational Logic, Sequencing, and Analytical Elimination

5.3 Relational Logic, Sequencing, and Analytical Elimination

Quick Answer: Ordering and arrangement problems use the same reasoning as two Aptitude Test parts: the CSB's 演繹推理 sample is a relationship deduction, and its Data Sufficiency sample is a finishing-order problem. Practising arrangements of 5 to 7 entities builds the speed both parts need. Success under the 75-second-per-item constraint requires abandoning exhaustive trial-and-error in favor of the 75-Second Protocol: (1) symbolize constraints compactly ($A > B$, $[C, D]$ block, $E \neq 1$); (2) anchor fixed positions immediately; (3) test adjacent entity blocks; and (4) deploy constraint-led option elimination. In multiple-choice questions, testing individual constraints against the answer choices often eliminates most invalid options in 20 seconds, without completing the full puzzle grid.

The Landscape of Relational Puzzles on the Aptitude Test

The CSB publishes only one sample for each Aptitude Test part, so it does not list puzzle types. Arrangement practice trains the working memory, systematic deduction and elimination skills that the deductive reasoning and data sufficiency parts both use. In graduate civil service roles—such as managing committee proceedings, public transport dispatching, or project task allocation—officers must organize competing priorities under rigid statutory and procedural constraints.

Practice puzzles of this kind fall into four structural archetypes:

1. Linear Sequencing & Positional Ranking: Ordering entities across a single dimensional continuum (e.g., presentation schedules from Slot 1 to Slot 6, queue positions, seniority ranks, or office floors).
2. Spatial & Circular Seating: Arranging committee members or delegates around a circular or rectangular table, incorporating facing directions (facing center vs. facing outward) and opposite pairings.
3. Grouping & Committee Selection: Selecting a subset of candidates (e.g., 4 officers from a pool of 7) to form a project team subject to demographic quotas, conditional inclusions, and personal exclusions.
4. Multi-Variable Matching Matrices: Correlating three or more disparate attribute dimensions (e.g., matching 5 officers to 5 departments, 5 office locations, and 5 project domains).

The 75-Second Solving Protocol

With only 45 minutes to solve 35 diverse aptitude questions, spending 3 to 4 minutes drawing expansive logic grids is a fatal time-management error. You must adopt a streamlined, four-phase solving protocol designed specifically for rapid standardized testing:

+--------------------------------------------------------------------------+
|                       THE 75-SECOND PROTOCOL FLOW                        |
+--------------------------------------------------------------------------+
| Phase 1: Symbolize Constraints  ->  Translate rules into shorthand       |
| Phase 2: Anchor Fixed Entities  ->  Lock 100% known positions onto board |
| Phase 3: Insert Relational Blocks-> Evaluate multi-element solid units   |
| Phase 4: Constraint Elimination ->  Screen options directly and verify   |
+--------------------------------------------------------------------------+

Phase 1: Compact Symbolic Notation

Never re-read the narrative text of a puzzle. As you read the stimulus for the first time, immediately transcribe every constraint into standard symbolic shorthand in your scrap margin:

• Adjacency / Immediate Sequence: "Officer B must speak immediately after Officer A" $\rightarrow$ $[A, B]$ (bracket indicates a solid, unbreakable block).
• Separation / Interval: "Exactly two speakers present between C and D" $\rightarrow$ $[C, \_, \_, D]$ or $[D, \_, \_, C]$.
• Relative Priority: "Department E must present earlier than Department F" $\rightarrow$ $E < F$.
• Negated Position: "Officer G cannot speak in Slot 1 or Slot 6" $\rightarrow$ $G \neq 1, 6$.
• Conditional Requirement: "If H is selected, J must also be selected" $\rightarrow$ $H \rightarrow J$ (and its contrapositive: $\neg J \rightarrow \neg H$).
• Mutual Exclusion: "K and L cannot serve on the same panel" $\rightarrow$ $K \rightarrow \neg L$ (or $K \neq L$).

Phase 2: Identifying and Placing Fixed Anchors

Search your symbolic list for Fixed Anchors—constraints that provide absolute, unconditional positional data:

• "Civil Engineering Department presents in Slot 1." $\rightarrow$ Place on your board immediately: [1: CEDD, 2: __, 3: __, 4: __, 5: __, 6: __].

Phase 3: Block Integration and Limited Scenario Splitting

Identify the largest "bulky" relational blocks (e.g., $[A, B]$ or $[C, \_, \_, D]$) and determine where they can physically fit around the fixed anchors.

• The Rule of Two Scenarios: If an arrangement can only branch in two ways, sketch Branch A and Branch B side by side. Never branch into three or more hypothetical trees under exam conditions. If a constraint generates three or more branches, leave it deferred and move to Phase 4.

Tactical Option Elimination: Bypassing the Full Grid

In many arrangement questions, candidates do not need to deduce the entire arrangement. The question asks: "Which of the following represents a fully acceptable schedule from Slot 1 to Slot 6?"

Spatial & Circular Seating Mechanics

Circular arrangement puzzles introduce angular and facing orientations that confuse untrained candidates. Keep these spatial principles firmly in mind:

1. Facing Inward vs. Facing Outward

• When delegates face inward toward the center of the table:
  • A person's left points in the clockwise direction.
  • A person's right points in the counter-clockwise direction.
• When delegates face outward (away from the center):
  • Left and right orientations are reversed.

2. Opposite Pairs in Even-Numbered Circles

In a circle with an even number of chairs $N$ (6 or 8 in the practice items here):

• The chair directly opposite Chair $k$ is given by the formula: $\text{Opposite}(k) = k + \frac{N}{2} \pmod N$
• In a 6-chair table ($N = 6$, $N/2 = 3$):
  • Chair 1 is opposite Chair $1 + 3 = 4$.
  • Chair 2 is opposite Chair $2 + 3 = 5$.
  • Chair 3 is opposite Chair $3 + 3 = 6$.

Comprehensive Worked Example: Multi-Department Scheduling

Examine the following simulated infrastructure summit scheduling puzzle, written as a high-difficulty practice item.

Puzzle Stimulus

Six government departments—Architectural Services Department (ArchSD), Buildings Department (BD), Civil Engineering and Development Department (CEDD), Drainage Services Department (DSD), Electrical and Mechanical Services Department (EMSD), and Fire Services Department (FSD)—are scheduled to deliver infrastructure project briefings in six consecutive hourly slots numbered 1 to 6.

The schedule is subject to the following statutory constraints:

1. ArchSD presents earlier than EMSD ($ArchSD < EMSD$), but ArchSD cannot present in Slot 1 ($ArchSD \neq 1$).
2. BD and DSD must present in consecutive slots in that immediate order (forming a solid $[BD, DSD]$ block).
3. Exactly two departmental briefings take place between CEDD and FSD.
4. CEDD delivers its briefing in Slot 1 ($CEDD = 1$).
5. EMSD does not present in Slot 6 ($EMSD \neq 6$).

Step 1: Constraint Transcription

• Rule 1: $ArchSD < EMSD$; $ArchSD \neq 1$
• Rule 2: $[BD, DSD]$ (consecutive block)
• Rule 3: $[CEDD, \_, \_, FSD]$ or $[FSD, \_, \_, CEDD]$
• Rule 4: $CEDD = 1$
• Rule 5: $EMSD \neq 6$

Step 2: Placing the Absolute Anchor

Rule 4 establishes a fixed anchor at Slot 1: [Slot 1: CEDD, Slot 2: __, Slot 3: __, Slot 4: __, Slot 5: __, Slot 6: __]

Step 3: Integrating the Interval Constraint

Rule 3 requires exactly two presentations between CEDD and FSD. Since CEDD is locked in Slot 1:

• The two intermediate slots are Slot 2 and Slot 3.
• Therefore, FSD must occupy Slot 4!

Our board is now 50% solved in 20 seconds: [Slot 1: CEDD, Slot 2: __, Slot 3: __, Slot 4: FSD, Slot 5: __, Slot 6: __]

Remaining vacant slots: Slots 2, 3, 5, 6. Remaining departments: ArchSD, BD, DSD, EMSD.

Step 4: Block Placement & Two-Branch Evaluation

Rule 2 requires BD and DSD to appear as an adjacent pair $[BD, DSD]$. In our vacant slots {2, 3, 5, 6}, there are only two possible locations where two consecutive empty slots exist:

• Branch A: $[BD, DSD]$ occupies Slots 5 and 6 ($BD = 5, DSD = 6$).
• Branch B: $[BD, DSD]$ occupies Slots 2 and 3 ($BD = 2, DSD = 3$).

Let us test both branches against our remaining constraints:

Testing Branch B ($BD = 2, DSD = 3$):

• If $BD = 2$ and $DSD = 3$, the only remaining vacant slots are Slots 5 and 6.
• ArchSD and EMSD must occupy Slots 5 and 6.
• Rule 1 mandates that ArchSD must present earlier than EMSD ($ArchSD < EMSD$).
• Therefore, ArchSD would take Slot 5, and EMSD would take Slot 6.
• Constraint Clash: Rule 5 explicitly states: EMSD does not present in Slot 6 ($EMSD \neq 6$).
• Result: Branch B is impossible and must be discarded!

Testing Branch A ($BD = 5, DSD = 6$):

• If $BD = 5$ and $DSD = 6$, the remaining vacant slots are Slots 2 and 3.
• ArchSD and EMSD must occupy Slots 2 and 3.
• Rule 1 requires $ArchSD < EMSD$. Therefore, ArchSD takes Slot 2, and EMSD takes Slot 3.
• Verify all rules:
  • $ArchSD < EMSD$: ArchSD (2) < EMSD (3). (Satisfied)
  • $ArchSD \neq 1$: ArchSD is in Slot 2. (Satisfied)
  • $[BD, DSD]$: BD is in 5, DSD is in 6. (Satisfied)
  • Two between CEDD and FSD: CEDD (1) and FSD (4) have 2 and 3 between them. (Satisfied)
  • $EMSD \neq 6$: EMSD is in Slot 3. (Satisfied)

The Inescapable Solution

+--------------------------------------------------------------------------+
|                     FINAL DEDUCED SUMMIT SCHEDULE                        |
+--------------------------------------------------------------------------+
| Slot 1 | Civil Engineering and Development Department (CEDD)             |
| Slot 2 | Architectural Services Department (ArchSD)                      |
| Slot 3 | Electrical and Mechanical Services Department (EMSD)            |
| Slot 4 | Fire Services Department (FSD)                                  |
| Slot 5 | Buildings Department (BD)                                       |
| Slot 6 | Drainage Services Department (DSD)                              |
+--------------------------------------------------------------------------+

Every possible question regarding this setup can now be answered instantaneously (e.g., Which department presents in Slot 2? ArchSD. Which department presents immediately before FSD? EMSD).

Grouping and Committee Selection Constraints

In team selection puzzles, the problem specifies a candidate pool and asks for an eligible sub-committee. Always convert selection rules into conditional implications and contrapositives:

1. Positive Conditional (Co-Selection): "If Officer X is selected, Officer Y must be selected" ($X \rightarrow Y$).
   • Valid Inference: If $Y$ is not on the team, $X$ cannot be on the team ($\neg Y \rightarrow \neg X$).
   • Invalid Inference: Selecting $Y$ does not force $X$ onto the team.
2. Mutual Exclusion: "Officer P and Officer Q cannot both serve on the taskforce" ($P \rightarrow \neg Q$).
   • Valid Inference: The team can contain $P$ alone, $Q$ alone, or neither. It can never contain both.
3. Biconditional (Package Deal): "Officer M serves if and only if Officer N serves" ($M \iff N$).
   • Valid Inference: $M$ and $N$ must either both be selected, or both be excluded.

Independent Preparation Advisory

This guide is published independently by OpenExamPrep for examination preparation and self-study purposes. It is not affiliated with, authorized by, sponsored by, or endorsed by the Civil Service Bureau of the HKSAR Government. Candidates should consult the official CSB examination portal for administrative guidelines and examination schedules.