14.3 Arrangement & Conditional Puzzles

Arrangement and conditional puzzles sit at the heart of ICTL-heritage aptitude practice. They model the same skill cyber operators use when reading change-control windows, firewall policy order, or incident timelines: given constraints, what orderings or assignments remain possible?

You do not need fancy notation — you need consistent symbols, a place to park definite facts, and the discipline to apply every rule before guessing.

Constraint Language Cheat Sheet

Translate English into crisp operators:

"Only if" trap: "A user is escalated only if MFA fails" means Escalated → MFA failed, not the converse. MFA can fail without escalation if another path exists in the story — but more importantly, the logical arrow points from escalation to the MFA-fail condition.

Ordering Method

1. Count the slots (people, hosts, tickets, time blocks).
2. List entities.
3. Write each constraint in symbols.
4. Place forced items first (unique positions).
5. Link blocks ("immediately before" pairs) as movable units.
6. Test remaining candidates against all constraints.
7. For multiple choice, eliminate any option that breaks one rule.

Worked seating puzzle

Six analysts sit in a row of desks: Ava, Ben, Cara, Dev, Elle, Farah.

Constraints:

1. Cara sits immediately left of Dev.
2. Ava sits at one of the ends.
3. Ben sits somewhere left of Cara.
4. Elle is not adjacent to Ava.
5. Farah sits immediately right of Dev.

From (1) and (5), Cara-Dev-Farah is a consecutive block of three: CDF.

Slots: 1 2 3 4 5 6. The CDF block can start at positions 1, 2, 3, or 4.

Ava is at an end: position 1 or 6.

If Ava is at 1, Elle is not adjacent → Elle ≠ 2. Ben must be left of Cara, so Ben is somewhere before the start of CDF.

Try CDF starting at 2: seats 2–4 = C,D,F. Then Ben must be in seat 1, but seat 1 is Ava — conflict if Ava is also forced to an end and Ben needs a seat left of Cara. More carefully: if Ava at 1 and CDF at 2–4, Ben has no seat left of Cara. So CDF cannot start at 2 when Ava is at 1.

If Ava at 1 and CDF at 3–5: seats = A, ?, C, D, F, ?. Ben must be left of Cara, so Ben in seat 2. Remaining seat 6 is Elle. Check Elle not adjacent to Ava: seats 6 and 1 are not adjacent. Valid arrangement: Ava, Ben, Cara, Dev, Farah, Elle.

If Ava at 1 and CDF at 4–6: Ben left of Cara means Ben in 2 or 3; Elle in the other of {2,3}. Elle would be in 2 or 3 — neither is adjacent to Ava at 1? Seat 2 is adjacent to Ava — so Elle cannot be in 2. Elle in 3, Ben in 2 works: A, Ben, Elle, C, D, F. Also valid.

If Ava at 6, CDF cannot include seat 6 as F unless F is Ava — impossible. CDF ending before 6: for example CDF at 3–5 leaves seat 6 Ava; Ben left of Cara (seat 3) → Ben in 1 or 2; Elle not adjacent to Ava → Elle ≠ 5, but 5 is F already; adjacent to Ava(6) is only seat 5, already Farah, so Elle automatically ok. Multiple placements remain.

Exam takeaway: you often need only enough deduction to answer the question asked ("Who sits at desk 2?") rather than enumerating every world. Branch only when the stem forces it.

Worked order puzzle (timeline)

Four change tickets must run in sequence: Patch, Reboot, Validate, Announce. Constraints:

• Validate is after Reboot.
• Announce is not first.
• Patch is immediately before Reboot.
• Announce is before Validate.

From Patch immediately before Reboot, treat PR as a block. Order must include PR as a unit, Validate after Reboot (so after the block), Announce before Validate, Announce not first.

Possible skeleton: PR, then others with Announce before Validate and Validate after R (already true if Validate is after the block).

Candidates:

• PR Announce Validate — Announce not first (ok), Validate after Reboot (ok), Announce before Validate (ok).
• Announce cannot be before PR if Announce is first — forbidden by "not first." So Announce between PR and Validate, or… could Validate be between P and R? No — PR is immediate.
• Could order be P R V Announce? Then Announce before Validate fails.
• P R Announce V works.
• Announce P R V: Announce is first — forbidden.

So a forced chain is Patch, Reboot, Announce, Validate as the unique completion under these constraints. (If a fifth entity appeared, uniqueness might vanish — always re-check.)

Conditional Chains

Basic chain drill

Rules:

1. If the VPN is down, then remote scans fail.
2. If remote scans fail, then the nightly report is late.
3. The nightly report is not late.

From (3) and the contrapositive of (2): report not late → remote scans did not fail. From that and the contrapositive of (1): scans did not fail → VPN is not down. Conclusion: The VPN is not down. Valid chain via successive contrapositives.

Mixed arrangement + conditional

Five servers in a maintenance order: W, X, Y, Z, V.

1. If W is first, then Y is third.
2. X is somewhere before Z.
3. V is not last.
4. Exactly one of W or Y is in an end slot (position 1 or 5).
5. Z is immediately after X when W is not first.

Suppose W is first. Then by (1) Y is third: W, ?, Y, ?, ?. Ends are W and position 5; Y is not at an end, so condition (4) "exactly one of W or Y at an end" is satisfied by W alone. V not last → position 5 ≠ V. X before Z. Remaining positions 2,4,5 for X,Z,V with X before Z and 5 ≠ V, so V in 2 or 4.

Suppose instead W is not first. Then (5) forces XZ as a consecutive block, and (4) requires that exactly one of W,Y occupies an end. V ≠ position 5.

You do not need every case for every question. If the stem asks "Which must be true?" compare options against both major cases and keep only what survives all surviving worlds.

Formal Conditional Pitfalls (Arrangement Flavor)

• Sufficient vs. necessary: "If MFA fails, alert fires" makes MFA fail sufficient for the alert, not necessary. The alert can have other causes unless the stem says otherwise.
• Vacuous satisfaction: If the trigger never happens, a conditional "If P then Q" is not broken by Q's absence in some formal readings — but exam items usually ask what must be true given an observed fact, so focus on forced consequences of the given observation.
• Biconditionals: Only when you see "if and only if" or clear two-way wording may you reverse the arrow freely.

Elimination Template for Multiple Choice

For each option:

1. Does it contradict a direct placement rule?
2. Does it break an adjacency / ordering rule?
3. Does it violate a conditional once a trigger is assumed?
4. If the option claims "must be true," is there a counter-model that still obeys all premises?

One failed check eliminates the option. Prefer answers that are forced in every remaining valid model.

Practice Mindset for Cyber Test Day

Arrangement and conditional items reward calm bookkeeping more than brilliance. Use scratch paper aggressively: slots, arrows, and struck-out letters beat mental juggling. When two rules conflict in a candidate diagram, discard that diagram immediately — do not "almost" accept it.

The same habit transfers to operational reasoning: change calendars, ACL order, and escalation matrices are constraint systems. Structured placement and if-then hygiene reduce both aptitude errors and real configuration mistakes.