📚 Advanced Study Notes – Reasoning Ability (Puzzles)
Target Audience: Cisco CCNP candidates (advanced level)
Format: Markdown, MIT‑style rigor, first‑principles derivations, edge‑case analysis, and a challenging puzzle with full solution.
Goal: Equip you with a universal toolkit for any reasoning puzzle that may appear in the CCNP exam.
Approach:
- Theory – build the logical foundation.
- Classification – identify puzzle types.
- Techniques – strategies & algorithms.
- Edge Cases – pitfalls & how to detect them.
- Practice – sample problems + a “world‑class” challenge.
1. Foundations: From First Principles
1.1 Logic & Propositional Calculus
| Symbol | Meaning | Example |
|---|---|---|
p |
A proposition (statement) | “Two devices are linked” |
¬p |
Negation | “Two devices are not linked” |
p ∧ q |
Conjunction | “A and B are linked and C and D are linked” |
p ∨ q |
Disjunction | “A and B are linked or C and D are linked” |
p → q |
Implication | “If A is linked, then B is linked” |
p ↔ q |
Biconditional | “A is linked iff B is linked” |
- Truth Tables give the truth value of any compound proposition.
- Logical equivalences (De Morgan, distributive, etc.) simplify complex statements.
1.2 Set Theory & Relations
- Universe
U– the set of all entities in the puzzle. - Subsets
S ⊆ U– e.g., “devices that are routers”. - Relations
R ⊆ U × U– e.g., “is directly connected to”. - Properties
P(x)– predicates to classify elements.
1.3 Graph Theory (for Spatial/Connection Puzzles)
- Vertices = entities (routers, switches, people, etc.)
- Edges = relationships (links, communication, adjacency).
- Degree, Path, Cycle, Connectedness – essential for reasoning about connectivity.
1.4 Combinatorics & Counting
- Permutations
n!– order matters. - Combinations
C(n, k)– order doesn’t matter. - Inclusion–Exclusion for overlapping constraints.
2. Puzzle Taxonomy
| Category | Typical Features | Representative Problems |
|---|---|---|
| Logical Sequencing | Ordering constraints, “first/last” questions | “Who sits in the middle?” |
| Deduction (Clues) | Multiple clues with conditional statements | “When A is north of B, C must be east of D.” |
| Numerical Riddles | Arithmetic relationships, ratios, differences | “The total bandwidth is 100 Gb, each link is 10 Gb.” |
| Spatial/Geometric | Arrangements on grids, adjacency, orientation | “Place the routers on a 3×3 board with no two adjacent.” |
| Constraint Satisfaction | Variables with domain, constraints between them | “Assign IP addresses with no conflicts.” |
| Lateral Thinking | Unconventional reasoning, “trick” logic | “All links are unidirectional, but data is bidirectional.” |
3. General Strategies
3.1 Translate to Formal Language
- Identify variables: e.g.,
a, b, cfor devices. - Define domain: e.g., positions 1–4, colors red/blue.
- Express clues as logical formulas.
- Build a truth table / constraint graph.
3.2 Use a Constraint‑Propagation Engine
- Forward Checking: After assigning a variable, immediately remove impossible values from neighboring variables.
- Arc Consistency (AC‑3): Iterate until no further pruning is possible.
3.3 Logical Deduction Chains
- From a clue “If A then B”, combine with “If B then C” to deduce “If A then C”.
- Contrapositive: “If not C then not A”.
3.4 Backtracking
- When no single deduction resolves a variable, assume a value, propagate, and backtrack on failure.
3.5 Symmetry Breaking
- Use canonical choices to reduce equivalent solutions (e.g., fix the first element to a particular value).
4. Edge Cases & Pitfalls
| Pitfall | What to Watch For | Fix |
|---|---|---|
| Ambiguous wording | “The device that is not in the middle” | Re‑read; check if “not middle” includes edge positions. |
| Hidden constraints | Solvers often miss “only one device can be in the top row” | Explicitly list all constraints before solving. |
| Circular logic | “If A then B; if B then A” | Recognize equivalence; may lead to multiple solutions. |
| Contradictory statements | “Device X is both north and south of Y” | Check for contradictions; if found, puzzle may be unsolvable or mis‑quoted. |
| Assuming uniqueness | “The only device that can be connected to both A and B” | Verify uniqueness by exploring all possibilities. |
5. Sample Problems & Solutions
Note: Each problem is followed by a concise solution that illustrates the method rather than exhaustive enumeration.
5.1 Logical Sequencing
Problem