Study guide
5.3 Relational Logic, Sequencing, and Analytical Elimination
Common Recruitment Examination CRE
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: CRE Structure, Eligibility, Administration, and the BLNST
1.1 What the CRE Is, Who Can Sit It, and Which Grades Need It 1.2 Paper Formats, Grading, Equivalent Results, and Result Certificates 1.3 Sittings, Applications, Exam-Day Rules, and Pacing 1.4 The BLNST, Your Results, and What Happens After the CRE
2 Chapter 2: Use of English — Reading Comprehension
2.1 Reading Strategy, Gist Identification, and Passage Architecture 2.2 Detail Retrieval, Drawing Inferences, and Author Tone 2.3 Vocabulary in Context, Nuance, and Figurative Language
3 Chapter 3: Use of English — Error Identification & Grammar Foundations
3.1 Grammatical Errors: Subject-Verb Agreement, Tense, and Mood 3.2 Syntax Errors: Misplaced Modifiers, Parallelism, and Prepositions 3.3 Lexical and Stylistic Errors: Diction, Redundancy, and Word Choice
4 Chapter 4: Use of English — Sentence Completion & Paragraph Improvement
4.1 Sentence Completion: Structural Connectives, Subordinate Clauses, and Collocations 4.2 Paragraph Improvement: Cohesion, Flow, and Sentence Combining 4.3 Paragraph Improvement: Revision for Conciseness, Tone, and Clarity
5 Chapter 5: Aptitude Test — Verbal & Deductive Reasoning
5.1 Verbal Reasoning: True, False, and Cannot Tell Methodology 5.2 Deductive Reasoning: Categorical Logic, Syllogisms, and Conditionals 5.3 Relational Logic, Sequencing, and Analytical Elimination
6 Chapter 6: Aptitude Test — Data Sufficiency & Numerical Reasoning
6.1 Data Sufficiency: The CRE Two-Clue Format 6.2 Data Sufficiency: Hidden Anchors, Redundant Clues, and Other Traps 6.3 Numerical Reasoning: Arithmetic, Geometric, and Multi-Tier Sequences
7 Chapter 7: Aptitude Test — Interpretation of Tables & Graphs
7.1 Statistical Tables: Rapid Extraction, Percentages, and Proportions 7.2 Bar Charts, Line Graphs, and Trend Extrapolation 7.3 Multi-Data Synthesis, Composite Tables, and Common Distractors
8 Chapter 8: Use of Chinese — Reading Comprehension and Character Recognition (閱讀理解與字詞辨識)
8.1 Use of Chinese: Article Reading (文章閱讀) 8.2 Use of Chinese: Short Extract Reading (片段╱語段閱讀) 8.3 Use of Chinese: Wrongly Written Characters (字詞辨識:錯別字) 8.4 Use of Chinese: Matching Simplified and Traditional Characters (字詞辨識:簡化字)
9 Chapter 9: Use of Chinese — Sentence Analysis and Usage (句子辨析與詞句運用)
9.1 Use of Chinese: Structural Sentence Errors (句子辨析:語病) 9.2 Use of Chinese: Logical Errors and Ambiguity (句子辨析:邏輯錯誤與歧義) 9.3 Use of Chinese: Near-Synonyms and Word Choice (詞句運用:詞語選用) 9.4 Use of Chinese: Idioms, Connectives, and Polite Forms (詞句運用:成語、關聯詞與敬謙辭) 9.5 Use of Chinese: Sentence Filling and Sentence Ordering (詞句運用:句子填充與排序)
5.3 Relational Logic, Sequencing, and Analytical Elimination
Key Takeaways Explain This Topic AI
Arrangement puzzles used for Aptitude Test practice require organizing entities across linear sequences, circular seating, or matching grids within a budget of about 75 seconds.
The fastest solving technique is 'Constraint-Led Option Elimination': testing individual rules directly against the answer options before attempting to solve the full puzzle.
When constructing an analytical grid, always position 'Absolute Anchors' first, integrate 'Fixed Relational Blocks', and restrict branching to at most two mutually exclusive sub-scenarios.
In circular seating puzzles with an even number of chairs, an individual sitting directly opposite another at position k k k in an N N N -seat circle occupies chair k + ( N / 2 ) k + (N/2) k + ( N /2 ) .
Grouping and selection puzzles require translating conditional inclusion ( A → B A \rightarrow B A → B ) and mutual exclusion ( C → ¬ D C \rightarrow \neg D C → ¬ D ) rules into contrapositives to rapidly eliminate illegal team combinations.
Last updated: October 2026
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 A > B A > B , [ C , D ] [C, D] [ C , D ] block, E ≠ 1 E \neq 1 E = 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:
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).
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.
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.
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 ] [A, B] [ A , B ] (bracket indicates a solid, unbreakable block).
Separation / Interval : "Exactly two speakers present between C and D" → \rightarrow → [ C , _ , _ , D ] [C, \_, \_, D] [ C , _ , _ , D ] or [ D , _ , _ , C ] [D, \_, \_, C] [ D , _ , _ , C ] .
Relative Priority : "Department E must present earlier than Department F" → \rightarrow → E < F E < F E < F .
Negated Position : "Officer G cannot speak in Slot 1 or Slot 6" → \rightarrow → G ≠ 1 , 6 G \neq 1, 6 G = 1 , 6 .
Conditional Requirement : "If H is selected, J must also be selected" → \rightarrow → H → J H \rightarrow J H → J (and its contrapositive: ¬ J → ¬ H \neg J \rightarrow \neg H ¬ J → ¬ H ).
Mutual Exclusion : "K and L cannot serve on the same panel" → \rightarrow → K → ¬ L K \rightarrow \neg L K → ¬ L (or K ≠ L K \neq L K = 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 ] [A, B] [ A , B ] or [ C , _ , _ , D ] [C, \_, \_, D] [ 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.
Loading diagram... 75-Second Protocol for Relational Logic and Analytical Elimination
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?"
Tip
The Inverse Attack Strategy: Never build the schedule yourself from scratch when the question provides complete permutations! Instead, take your constraints one by one and scan down the options to disqualify violators:
Apply Constraint 1 ( [ B , D ] [B, D] [ B , D ] block): Option 3 has B B B in Slot 2 and D D D in Slot 4 → \rightarrow → Eliminate Option 3 .
Apply Constraint 2 ( A < E A < E A < E ): Option 1 has E E E in Slot 2 and A A A in Slot 5 → \rightarrow → Eliminate Option 1 .
Apply Constraint 3 ( C = 1 C = 1 C = 1 ): Option 4 has C C C in Slot 3 → \rightarrow → Eliminate Option 4 .
Select Option 2 immediately in under 25 seconds without ever testing the remaining rules!
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 N N (6 or 8 in the practice items here):
The chair directly opposite Chair k k k is given by the formula: Opposite ( k ) = k + N 2 ( m o d N ) \text{Opposite}(k) = k + \frac{N}{2} \pmod N Opposite ( k ) = k + 2 N ( mod N )
In a 6-chair table ( N = 6 N = 6 N = 6 , N / 2 = 3 N/2 = 3 N /2 = 3 ):
Chair 1 is opposite Chair 1 + 3 = 4 1 + 3 = 4 1 + 3 = 4 .
Chair 2 is opposite Chair 2 + 3 = 5 2 + 3 = 5 2 + 3 = 5 .
Chair 3 is opposite Chair 3 + 3 = 6 3 + 3 = 6 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:
ArchSD presents earlier than EMSD ( A r c h S D < E M S D ArchSD < EMSD A rc h S D < EMS D ), but ArchSD cannot present in Slot 1 ( A r c h S D ≠ 1 ArchSD \neq 1 A rc h S D = 1 ).
BD and DSD must present in consecutive slots in that immediate order (forming a solid [ B D , D S D ] [BD, DSD] [ B D , D S D ] block).
Exactly two departmental briefings take place between CEDD and FSD.
CEDD delivers its briefing in Slot 1 ( C E D D = 1 CEDD = 1 CE DD = 1 ).
EMSD does not present in Slot 6 ( E M S D ≠ 6 EMSD \neq 6 EMS D = 6 ).
Step 1: Constraint Transcription
Rule 1: A r c h S D < E M S D ArchSD < EMSD A rc h S D < EMS D ; A r c h S D ≠ 1 ArchSD \neq 1 A rc h S D = 1
Rule 2: [ B D , D S D ] [BD, DSD] [ B D , D S D ] (consecutive block)
Rule 3: [ C E D D , _ , _ , F S D ] [CEDD, \_, \_, FSD] [ CE DD , _ , _ , FS D ] or [ F S D , _ , _ , C E D D ] [FSD, \_, \_, CEDD] [ FS D , _ , _ , CE DD ]
- Rule 4: C E D D = 1 CEDD = 1 CE DD = 1
- Rule 5: E M S D ≠ 6 EMSD \neq 6 EMS D = 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 [ B D , D S D ] [BD, DSD] [ B D , D S D ] . In our vacant slots {2, 3, 5, 6} , there are only two possible locations where two consecutive empty slots exist:
Branch A : [ B D , D S D ] [BD, DSD] [ B D , D S D ] occupies Slots 5 and 6 ( B D = 5 , D S D = 6 BD = 5, DSD = 6 B D = 5 , D S D = 6 ).
Branch B : [ B D , D S D ] [BD, DSD] [ B D , D S D ] occupies Slots 2 and 3 ( B D = 2 , D S D = 3 BD = 2, DSD = 3 B D = 2 , D S D = 3 ).
Let us test both branches against our remaining constraints:
Testing Branch B ( B D = 2 , D S D = 3 BD = 2, DSD = 3 B D = 2 , D S D = 3 ):
If B D = 2 BD = 2 B D = 2 and D S D = 3 DSD = 3 D S D = 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 ( A r c h S D < E M S D ArchSD < EMSD A rc h S D < EMS D ).
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 ( E M S D ≠ 6 EMSD \neq 6 EMS D = 6 ).
Result: Branch B is impossible and must be discarded !
Testing Branch A ( B D = 5 , D S D = 6 BD = 5, DSD = 6 B D = 5 , D S D = 6 ):
If B D = 5 BD = 5 B D = 5 and D S D = 6 DSD = 6 D S D = 6 , the remaining vacant slots are Slots 2 and 3 .
ArchSD and EMSD must occupy Slots 2 and 3.
Rule 1 requires A r c h S D < E M S D ArchSD < EMSD A rc h S D < EMS D . Therefore, ArchSD takes Slot 2 , and EMSD takes Slot 3 .
Verify all rules:
- A r c h S D < E M S D ArchSD < EMSD A rc h S D < EMS D : ArchSD (2) < EMSD (3). (Satisfied)
- A r c h S D ≠ 1 ArchSD \neq 1 A rc h S D = 1 : ArchSD is in Slot 2. (Satisfied)
- [ B D , D S D ] [BD, DSD] [ B D , D S D ] : 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)
- E M S D ≠ 6 EMSD \neq 6 EMS D = 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:
Positive Conditional (Co-Selection): "If Officer X is selected, Officer Y must be selected" ( X → Y X \rightarrow Y X → Y ).
Valid Inference: If Y Y Y is not on the team, X X X cannot be on the team ( ¬ Y → ¬ X \neg Y \rightarrow \neg X ¬ Y → ¬ X ).
Invalid Inference: Selecting Y Y Y does not force X X X onto the team.
Mutual Exclusion: "Officer P and Officer Q cannot both serve on the taskforce" ( P → ¬ Q P \rightarrow \neg Q P → ¬ Q ).
Valid Inference: The team can contain P P P alone, Q Q Q alone, or neither. It can never contain both.
Biconditional (Package Deal): "Officer M serves if and only if Officer N serves" ( M ⟺ N M \iff N M ⟺ N ).
Valid Inference: M M M and N N N must either both be selected, or both be excluded.
Independent Preparation Advisory
This guide is published independently by ExamFinch 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.