📚 Advanced Study Notes – Puzzles (Reasoning Ability)
Puducherry TET – Teacher Eligibility Test (Teacher) – Reasoning Ability
These notes are written from a first‑principles perspective, drawing on rigorous reasoning, formal logic, combinatorics, and algorithmic thinking. They are intended for students who already have a solid grounding in elementary logic and mathematics and who wish to master the art of puzzle solving at an MIT‑level depth.
1. What is a Puzzle?
| Definition | Key Features | Typical Types |
|---|---|---|
| Puzzle | A problem that requires non‑obvious combinatorial or logical reasoning to reach a single, usually unique, solution. | • Logic/Grid puzzles • Sequence & pattern puzzles • Spatial / visual puzzles • Number puzzles (e.g. Sudoku, Kakuro) • Word puzzles (anagrams, crosswords) • Lateral‑thinking riddles |
| Goal | Derive the solution from the given facts by applying sound deduction, inference, or constructive reasoning. | – |
| Constraints | • Limited time (TET = 30 min) • One‑shot: no second‑guessing after an answer is written • No external tools (calculator, internet) |
– |
2. Theoretical Foundations
2.1. Logical Foundations
-
Propositional Logic
- Atoms:
P, Q, R, …(simple statements) - Connectives:
¬(not),∧(and),∨(or),→(implies),↔(iff) - Inference Rules: Modus Ponens, Modus Tollens, Hypothetical Syllogism, Disjunctive Syllogism.
- Truth Tables: For evaluating statements systematically.
- Atoms:
-
First‑Order Logic (FOL)
- Quantifiers: ∀ (for all), ∃ (there exists).
- Predicates:
Student(x),SitsIn(x, y). - Skolemization: Removing existential quantifiers by introducing Skolem constants/functions.
-
Constraint Satisfaction Problems (CSP)
- Variables:
X1, X2, … - Domains: Possible values for each variable.
- Constraints: Unary, binary, ternary, etc.
- Backtracking + Arc Consistency (AC‑3) as algorithmic tools.
- Variables:
2.2. Combinatorics & Counting
| Concept | Why it matters |
|---|---|
| Permutations & Combinations | Counting arrangements in “Who sits where?” puzzles. |
| Inclusion–Exclusion | Counting objects that satisfy multiple overlapping conditions. |
| Pigeonhole Principle | Detecting guaranteed duplicates or missing items. |
| Catalan Numbers | Counting valid bracket sequences, tree shapes. |
| Generating Functions | Solving linear recurrences in sequence puzzles. |
2.3. Graph Theory
- Vertices & Edges: Model relationships (e.g., “A and B sit next to each other” → edge between A and B).
- Graph Coloring: Useful in scheduling and seating puzzles.
- Hamiltonian Path: Paths that visit each node exactly once, relevant for “visit all rooms” puzzles.
- Clique & Independent Set: Detecting incompatible sets.
3. Systematic Approach to Puzzle Solving
| Step | What to Do | Example |
|---|---|---|
| 1. Parse the Statement | Identify all variables, constraints, and goal. | “There are 5 students: A,B,C,D,E. A sits left of B.” |
| 2. Formalize | Translate into logic or CSP representation. | Variables pos(A)…pos(E) with domain {1…5}. Constraint: pos(A) = pos(B) - 1. |
| 3. Detect Constraints Hierarchy | Distinguish hard (must‑hold) vs soft (may‑hold). | “If C sits next to D, then E must be on the opposite side.” |
| 4. Apply Inference | Use deduction rules to prune domain. | If pos(A)=1, then pos(B)=2 (by step 2). |
| 5. Backtrack & Branch | Try possibilities systematically. | Try pos(C)=3; if contradiction → backtrack. |
| 6. Verify Uniqueness | Ensure the solution is unique (TET puzzles usually have a single solution). | If two solutions, re‑examine constraints. |
| 7. Check Edge Cases | Verify no hidden contradictions (e.g., “exactly one” vs “at least one”). | “Only one student sits in the middle” → check each solution. |
| 8. Record the Answer | Write clearly; double‑check that you didn’t miss a constraint. | A - B - C - D - E |
3.1. Special Strategies
| Puzzle Type | Strategy | Why it works |
|---|---|---|
| Grid / Seating | Elimination Grid: Fill a table with possible positions, cross out impossible ones. | Visualizes constraints; reduces search space. |
| Sequence | Pattern Matching + Recurrence Relations | Look for arithmetic, geometric, Fibonacci, or other recurrence patterns. |
| Number (e.g., Sudoku) | Constraint Propagation + Backtracking | Use row/column/box constraints to reduce possibilities. |
| Word | Anagram / Letter Scrambling | Look for letter frequency, common prefixes/suffixes. |
| Spatial | Geometric Reasoning | Use angles, distances, orientation to deduce relative positions. |
| Lateral | Re‑frame the Problem | Look for hidden meanings or double‑interpretations. |
4. Edge Cases & Common Pitfalls
| Pitfall | Explanation | How to Avoid |
|---|---|---|
| **Assuming “exactly” vs “at least” |