9.3 Positional Logic, Seating Arrangements & Spatial Mapping

Positional Logic, Seating Arrangements & Spatial Mapping

Positional logic, analytical seating arrangements, and spatial mapping represent advanced analytical reasoning domains on the NAPOLCOM PNP Entrance Examination (PNPE). In day-to-day law enforcement operations, police supervisors must organize tactical formations, plan perimeter containment cordons, coordinate multi-unit search patterns, reconstruct vehicular movement from incident testimonies, and assign personnel across patrol beats. These items test a candidate's mental discipline in organizing complex, interdependent constraints into coherent spatial configurations without succumbing to cognitive overload.

Independent Preparation Notice: This study module is independently developed by OpenExamPrep to assist prospective applicants in mastering the positional logic and spatial mapping concepts required for the examination. OpenExamPrep is an independent educational publisher and is not affiliated with, endorsed by, or partnered with the National Police Commission (NAPOLCOM) or the Philippine National Police (PNP).

---

1. Linear Arrangements: Single-Row & Double-Row Configurations

Linear arrangement problems require ordering a set of individuals, vehicles, or duty posts along a straight line based on relational clues.

Single-Row Configurations

In single-row problems, unless otherwise stated, individuals are assumed to face North (forward toward the top of the page). Under this orientation:

• "To the Left" corresponds to the West (toward the left margin).
• "To the Right" corresponds to the East (toward the right margin).

Types of Relational Clues

1. Immediate Neighbor Constraints: Statements such as "Officer A sits immediately to the left of Officer B" establish an indivisible contiguous block: [A, B]. These two entities must always be treated as a single compound element in scratchpad permutations.
2. Relative Directional Spacing: Statements such as "Officer C sits to the left of Officer D" do not mean they are adjacent; it merely means C occupies some position to the left of D (C ... D), with zero, one, or multiple individuals intervening.
3. Bracketed Gap Spacing: Statements such as "Exactly two officers sit between Officer E and Officer F" establish a template of length four: [E, _, _, F] or [F, _, _, E].
4. Definite Terminal Positioning: Statements such as "Officer G occupies the extreme left end" provide absolute structural anchors that eliminate broad classes of permutations immediately.

Double-Row Configurations (Facing Rows)

Double-row problems depict two parallel lines of individuals facing each other across an aisle or briefing table:

• Row 1 (Facing South): Their "Left" is toward the East (observer's right), and their "Right" is toward the West (observer's left).
• Row 2 (Facing North): Their "Left" is toward the West (observer's left), and their "Right" is toward the East (observer's right).
• Directly Opposite Pairs: If Officer X in Row 1 faces Officer Y in Row 2, both occupy identical columnar indices across parallel tracks.

Row 1 (Facing South):   [ Pos 1 ] [ Pos 2 ] [ Pos 3 ] [ Pos 4 ]  <── Left is East (Observer Right)
                             ▲         ▲         ▲         ▲
                             │         │         │         │   (Directly Facing Each Other)
                             ▼         ▼         ▼         ▼
Row 2 (Facing North):   [ Pos 1 ] [ Pos 2 ] [ Pos 3 ] [ Pos 4 ]  ──> Right is East (Observer Right)

---

2. Circular Seating Arrangements: Inward vs. Outward Orientations

Circular seating arrangements introduce closed topological loops. Unlike linear queues, a circle has no natural "beginning" or "extreme end"; positioning is entirely relative.

The Critical Rule of Facing Directions

A candidate's most common error in circular problems is misidentifying left and right. Left and right depend entirely on which way the individual is facing:

• Facing Center (Inward):
  • Imagine yourself sitting in the chair looking inward toward the center.
  • Your Left hand points in the Clockwise (CW) direction around the table.
  • Your Right hand points in the Counter-Clockwise (CCW) direction around the table.
• Facing Away from Center (Outward):
  • Imagine yourself sitting in the chair looking outward away from the center.
  • Your Left hand points in the Counter-Clockwise (CCW) direction around the table.
  • Your Right hand points in the Clockwise (CW) direction around the table.

Diametric Opposites & Parity Constraints

In symmetric circles with an even number of seats ($N$):

• The person sitting directly opposite any individual is located exactly $\frac{N}{2}$ positions away in either direction.
• For an 8-person table, Officer 1 and Officer 5 are diametric opposites ($8 / 2 = 4$ seats apart; exactly three individuals sit between them on either side).
• For an odd number of seats (e.g., $N=5$ or $N=7$), no individual has a directly opposite seat; positions are offset.

---

3. Relational & Attribute Matching Grids (The Elimination Matrix)

Attribute matching items present three or four categories of biographical and operational data—such as four police officers (Alvarez, Bautista, Castro, Dizon), four ranks (Patrolman, Corporal, Staff Sergeant, Lieutenant), four specialized units (CIDG, HPG, Traffic, Maritime), and four patrol vehicle numbers (101, 102, 103, 104). Candidates must deduce the unique assignment of each officer.

The Cross-Referencing Matrix Method

Attempting to solve multi-attribute puzzles mentally leads to working-memory saturation. Constructing a two-dimensional elimination grid on scratch paper provides an infallible, rapid solution:

1. Grid Setup: List individuals along the vertical rows, and cross-reference them against specialized columns for Ranks, Units, and Vehicles.
2. Direct Confirmation (Positive Tick $\checkmark$): When a clue states a definite match (e.g., "Alvarez is the Lieutenant"), place a $\checkmark$ at that intersection. Immediately fill the entire remaining row and column within that category block with negative crosses ($\times$), because each officer holds exactly one rank, and each rank is held by exactly one officer.
3. Direct Negative Elimination (Cross $\times$): When a clue states an incompatibility (e.g., "Bautista is not assigned to CIDG"), place an $\times$ in that cell.
4. Transitive Chain Deduction: Link confirmed attributes. If Officer Castro drives Vehicle 104, and the Corporal drives Vehicle 104, then Castro must be the Corporal.

                [------ RANKS ------]   [------- UNITS -------]
OFFICER         Pat   Cpl   SSg   Lt    CIDG   HPG  Traf   Mar
─────────────────────────────────────────────────────────────
Alvarez          ✗     ✗     ✗     ✓      ✗     ✓     ✗     ✗   <── Confirmed Lt / HPG
Bautista         ✗     ✓     ✗     ✗      ✓     ✗     ✗     ✗   <── Confirmed Cpl / CIDG
Castro           ✓     ✗     ✗     ✗      ✗     ✗     ✓     ✗   <── Confirmed Pat / Traffic
Dizon            ✗     ✗     ✓     ✗      ✗     ✗     ✗     ✓   <── Confirmed SSg / Maritime

---

4. Directional & Compass Navigation (Bearings & Displacement)

Navigation items require tracking the path of a patrol unit, search team, or suspect across multiple turns, then calculating their final heading or net displacement from the point of origin.

Compass Bearings and Coordinate Conventions

• Cardinal Headings: North ($0^\circ / 360^\circ$), East ($90^\circ$), South ($180^\circ$), West ($270^\circ$).
• Intercardinal Headings: North-East ($45^\circ$), South-East ($135^\circ$), South-West ($225^\circ$), North-West ($315^\circ$).
• Relative Turns vs. Absolute Headings:
  • Turning "to the right" means rotating $+90^\circ$ clockwise from your current heading.
  • Turning "to the left" means rotating $-90^\circ$ counter-clockwise from your current heading.
  • Turning "around" ($180^\circ$ U-turn) inverts your current heading.

Cumulative Distance vs. Net Displacement

A frequent testing trap involves confusing cumulative travel distance with net straight-line displacement:

• Cumulative Distance: The scalar arithmetic sum of all distances traversed ($d_1 + d_2 + d_3 + \dots$). This represents the patrol car's odometer reading.
• Net Displacement: The straight-line vector distance from the starting origin $(0,0)$ to the final terminus $(x, y)$, accompanied by a compass direction.

Vector Addition & The Pythagorean Theorem

Assign coordinate values to movement: North $= +y$, South $= -y$, East $= +x$, West $= -x$.

1. Sum all horizontal movements to find net East-West displacement: $\Delta x = \sum x$.
2. Sum all vertical movements to find net North-South displacement: $\Delta y = \sum y$.
3. Calculate net straight-line distance ($c$) using the Pythagorean theorem: $c = \sqrt{(\Delta x)^2 + (\Delta y)^2}$

Essential Pythagorean Triples for Fast Mental Calculation

Because calculators are prohibited on the PNPE, navigation problems almost always utilize integer Pythagorean triples. Memorizing these basic ratios eliminates the need for manual square root extraction:

• $3 - 4 - 5$ (and multiples: $6 - 8 - 10$, $9 - 12 - 15$, $12 - 16 - 20$, $15 - 20 - 25$)
• $5 - 12 - 13$ (and multiple: $10 - 24 - 26$)
• $8 - 15 - 17$
• $7 - 24 - 25$

Worked Diagnostic: A patrol car travels $12\text{ km}$ North, turns East and travels $9\text{ km}$. Net displacement is $\sqrt{12^2 + 9^2} = \sqrt{144 + 81} = \sqrt{225} = 15\text{ km}$ North-East. The legs $9$ and $12$ correspond to $3 \times 3$ and $4 \times 3$, so the hypotenuse is immediately $5 \times 3 = 15\text{ km}$.

---

5. The 2-Minute Positional Problem-Solving Protocol

To solve multi-constraint arrangement items under high test-day pressure, follow this standardized five-stage protocol:

1. Stage 1 (Classify the Geometry): Identify immediately whether the scenario is linear, double-row, circular, multi-attribute, or compass navigation.
2. Stage 2 (Establish the Anchor Clue): Search the clue list for the most rigid, definite anchor point (e.g., an individual at an extreme end, a diametric opposite, or a fixed coordinate origin). Do not begin drawing from ambiguous relative clues.
3. Stage 3 (Bind Contiguous Blocks): Group immediate neighbors into bracketed compound blocks ([A, B]). Note whether their internal relative order is fixed or reversible.
4. Stage 4 (Eliminate Branched Possibilities): Insert the remaining clues into the skeletal diagram. If a clue allows two branches, sketch both lightly; use negative constraints to discard the invalid branch quickly.
5. Stage 5 (Verify All Constraints): Before shading the answer sheet, re-read every sentence in the prompt to verify that your final layout violates zero conditions.