Puzzles

Non-Verbal & Puzzles · free study notes

Puzzles – Advanced Study Notes for the Mizoram TET

(Reasoning Ability – “Puzzles” Section)

Audience – Candidates preparing for the Mizoram Teacher Eligibility Test (TET)
Depth – MIT‑level treatment: first principles, rigorous reasoning, deeper theory, edge cases, and a challenging problem.
Format – Markdown, clear headings, numbered lists, tables, and LaTeX‑style math for precision.


1. Introduction

Puzzles in reasoning tests are structured problems that require logical deduction from a set of conditions. Unlike open‑ended math problems, puzzles have a unique solution (or a set of solutions that must be verified).

Why they matter

  • They test critical thinking, pattern recognition, deductive reasoning, and problem‑solving speed.
  • They are language‑independent (most conditions are in plain English).
  • They often appear in the Reasoning Ability section of competitive exams, including the Mizoram TET.

2. Core Logical Foundations

Concept Why It Matters Typical Representation
Propositional Logic Allows representation of “if‑then” and “and/or” statements. P → Q, P ∧ Q, ¬P
Set Theory & Venn Diagrams Handles “at least one” or “exactly one” constraints. A ∩ B, A \ B
Constraint Satisfaction Puzzles are essentially CSPs: variables, domains, constraints. Variables: X = {x1, x2, …}, Constraints: x1 ≠ x2
Combinatorics Counting the number of possibilities; used for feasibility checks. n! / (n-k)!
Graph Theory Many puzzles can be expressed as graph coloring or path problems. Graph G=(V,E), coloring c:V→{1,…,k}
Backtracking & Branch‑and‑Bound Systematic enumeration of possibilities; pruning with constraints. Depth‑first search on variable assignments.

Key Takeaway: All puzzles can be reduced to a set of logical constraints; solving them is a matter of systematically exploring the solution space while pruning impossible branches.


3. Types of Puzzles & Representative Examples

Category Typical Features Representative TET‑style Problem
Sequencing Order of items, adjacency, distance constraints. “Four students are standing in a line; if A is to the left of B, …”
Seating / Arrangement Seats, relative positions, restrictions on neighbors. “Eight teachers are seated around a circular table with no two women next to each other.”
Numerical Arithmetic relations, alphametics, Sudoku‑style constraints. “The product of the three numbers is 432; their sum is 30.”
Spatial / Geometric Placement on a grid, overlapping shapes, area relationships. “Three squares of different sizes are placed inside a rectangle.”
Word / Symbolic Word ladders, letter substitution, symbol‑placement puzzles. “Replace X with a letter such that ‘XOX’ becomes a valid word.”
Graph‑Based Coloring, bipartite matching, Hamiltonian path. “Paint all edges of a triangle so that no two adjacent edges share a color.”
Counting / Combinatorial Counting arrangements that satisfy constraints. “How many ways can 6 people be seated so that no two friends sit together?”

4. Theoretical Deep‑Dive

4.1 Constraint Satisfaction Problem (CSP)

  • Variables: each element that needs a value (X1, X2, …).
  • Domains: possible values ({1,…,n} or a set of objects).
  • Constraints: binary (between two variables) or higher‑order.

CSP Example (Seating):
Let S1,…,S8 denote seat positions.
Constraints:

  • `S1 ≠ S2

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.