Study guide
4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations
TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy
1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing
2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic
2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators
3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out
3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)
4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic
4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables
5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections
5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections
6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic
6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings
7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic
7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles
8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals
8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)
9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities
9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)
10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems
10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems
11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics
11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas
12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus
12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment
13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons
13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares
14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry
14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles
4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations
Key Takeaways Explain This Topic AI
Superposition matrices combine the first two cells of a row or column to produce the third cell using Set Union ( C 3 = C 1 ∪ C 2 C_3 = C_1 \cup C_2 C 3 = C 1 ∪ C 2 ), Set Intersection ( C 3 = C 1 ∩ C 2 C_3 = C_1 \cap C_2 C 3 = C 1 ∩ C 2 ), or Boolean XOR ( C 3 = C 1 ⊕ C 2 C_3 = C_1 \oplus C_2 C 3 = C 1 ⊕ C 2 , where overlapping segments cancel out)
A single-feature diagnostic tests presence or absence across complete rows to eliminate inconsistent Boolean rules; confirm the candidate using additional features and rows before filling the missing cell.
Latin-Square Attribute Permutation ('Üçlü Dağılım Kuralı') distributes three distinct states of each independent visual layer—outer shape, inner shading, orientation, and element count—so each state appears once per row and column
Some 3x3 matrices use the same rule across rows and columns; others use only one stated direction, while constant main diagonals ( C 1 , 1 = C 2 , 2 = C 3 , 3 C_{1,1} = C_{2,2} = C_{3,3} C 1 , 1 = C 2 , 2 = C 3 , 3 ) or anti-diagonals ( C 1 , 3 = C 2 , 2 = C 3 , 1 C_{1,3} = C_{2,2} = C_{3,1} C 1 , 3 = C 2 , 2 = C 3 , 1 ) signal a cyclic shift of one step per row
Independent hybrid matrices can apply separate rules to edges and dots. Attribute-group diagrams instead map group membership to colours; verify the demonstrated rule at each position.
Last updated: October 2026
3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations
Quick Strategy: Never stare at a 3 × 3 3 \times 3 3 × 3 visual matrix ( Şekil Matrisi ) as nine holistic pictures. First check whether the third cell in each row is built by superimposing the first two cells ( Üst Üste Bindirme ) or by permuting three discrete shapes/fills across the row ( Üçlü Dağılım ). If it is superposition, track one single line segment across Row 1 and Row 2 using binary 1 1 1 (present) and 0 0 0 (absent) to identify the rule in under 5 seconds.
- The Four Core Matrix Logic Engines
- 1. Set Union (Boolean OR / Birleşim — C 3 = C 1 ∪ C 2 C_3 = C_1 \cup C_2 C 3 = C 1 ∪ C 2 )
Under the Set Union rule, Cell 1 and Cell 2 are superimposed directly on top of one another, and every line segment, arc, or dot present in either Cell 1 or Cell 2 survives in Cell 3 : C 3 = C 1 ∪ C 2 C_3 = C_1 \cup C_2 C 3 = C 1 ∪ C 2
Visual Signature: Cell 3 is always the most visually dense figure in every row or column ( ∣ C 3 ∣ ≥ max ( ∣ C 1 ∣ , ∣ C 2 ∣ ) \lvert C_3 \rvert \ge \max(\lvert C_1 \rvert, \lvert C_2 \rvert) ∣ C 3 ∣ ≥ max (∣ C 1 ∣ , ∣ C 2 ∣) ). No segment present in C 1 C_1 C 1 or C 2 C_2 C 2 ever disappears in C 3 C_3 C 3 .
Binary Truth Table: ( 0 , 0 ) → 0 (0, 0) \to 0 ( 0 , 0 ) → 0 , ( 1 , 0 ) → 1 (1, 0) \to 1 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 1 (0, 1) \to 1 ( 0 , 1 ) → 1 , and ( 1 , 1 ) → 1 (1, 1) \to 1 ( 1 , 1 ) → 1 .
2. Set Intersection (Boolean AND / Kesişim — C 3 = C 1 ∩ C 2 C_3 = C_1 \cap C_2 C 3 = C 1 ∩ C 2 )
Under the Set Intersection rule, Cell 1 and Cell 2 are superimposed, and only the line segments, vertices, or shaded sub-regions common to both Cell 1 and Cell 2 survive in Cell 3 : C 3 = C 1 ∩ C 2 C_3 = C_1 \cap C_2 C 3 = C 1 ∩ C 2
Visual Signature: Cell 3 is always the sparsest figure in every row or column ( ∣ C 3 ∣ ≤ min ( ∣ C 1 ∣ , ∣ C 2 ∣ ) \lvert C_3 \rvert \le \min(\lvert C_1 \rvert, \lvert C_2 \rvert) ∣ C 3 ∣ ≤ min (∣ C 1 ∣ , ∣ C 2 ∣) ). Any stroke that appears in only one of the first two cells vanishes.
Binary Truth Table: ( 0 , 0 ) → 0 (0, 0) \to 0 ( 0 , 0 ) → 0 , ( 1 , 0 ) → 0 (1, 0) \to 0 ( 1 , 0 ) → 0 , ( 0 , 1 ) → 0 (0, 1) \to 0 ( 0 , 1 ) → 0 , and ( 1 , 1 ) → 1 (1, 1) \to 1 ( 1 , 1 ) → 1 .
3. Symmetric Difference (Boolean XOR / Aynı Olanlar Silinir — C 3 = C 1 ⊕ C 2 C_3 = C_1 \oplus C_2 C 3 = C 1 ⊕ C 2 ) C 3 = C 1 ⊕ C 2 = ( C 1 ∪ C 2 ) ∖ ( C 1 ∩ C 2 ) C_3 = C_1 \oplus C_2 = (C_1 \cup C_2) \setminus (C_1 \cap C_2) C 3 = C 1 ⊕ C 2 = ( C 1 ∪ C 2 ) ∖ ( C 1 ∩ C 2 )
Visual Signature: Two rich figures with many shared edges can produce a surprisingly simple third figure because their shared skeleton erases itself.
Binary Truth Table: ( 0 , 0 ) → 0 (0, 0) \to 0 ( 0 , 0 ) → 0 , ( 1 , 0 ) → 1 (1, 0) \to 1 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 1 (0, 1) \to 1 ( 0 , 1 ) → 1 , and ( 1 , 1 ) → 0 (1, 1) \to 0 ( 1 , 1 ) → 0 .
The Inverse Variant (Boolean XNOR / Farklı Olanlar Silinir ): Occasionally a matrix reverses the cancellation rule within a fixed reference grid (such as a 2 × 2 2 \times 2 2 × 2 square with 8 possible border/internal segments). Under XNOR ( C 3 = C 1 ⊕ C 2 ‾ C_3 = \overline{C_1 \oplus C_2} C 3 = C 1 ⊕ C 2 ), segments that differ between C 1 C_1 C 1 and C 2 C_2 C 2 are erased, while segments where C 1 C_1 C 1 and C 2 C_2 C 2 agree—either both present ( 1 , 1 ) → 1 (1,1) \to 1 ( 1 , 1 ) → 1 or both absent ( 0 , 0 ) → 1 (0,0) \to 1 ( 0 , 0 ) → 1 —are drawn in C 3 C_3 C 3 .
The Single-Feature Diagnostic
Trying to superimpose two intricate geometric diagrams in your head wastes time and invites spatial errors. Instead, execute the Single-Edge Diagnostic :
Pick one atomic feature —for example, the top horizontal segment of a square frame, the left diagonal of an X, or the center dot .
Record its presence ( 1 1 1 ) or absence ( 0 0 0 ) across Row 1 and Row 2:
If a row shows ( 1 , 1 ) → 0 (1, 1) \to 0 ( 1 , 1 ) → 0 , you can immediately eliminate OR and AND ; XOR is a candidate among OR, AND and XOR; check other features before excluding subtraction or other rules.
If a row shows ( 1 , 0 ) → 0 (1, 0) \to 0 ( 1 , 0 ) → 0 , you can immediately eliminate OR and XOR ; AND is a candidate, as are XNOR or Set Subtraction C 2 ∖ C 1 C_2 \setminus C_1 C 2 ∖ C 1 ; use additional binary cases to distinguish them.
If Row 1 shows ( 1 , 0 ) → 1 (1, 0) \to 1 ( 1 , 0 ) → 1 and Row 2 shows ( 1 , 1 ) → 1 (1, 1) \to 1 ( 1 , 1 ) → 1 , OR is the candidate among these rules; verify additional features.
Apply that confirmed operator to the exact same atomic segment in Row 3 ( C 3 , 1 C_{3,1} C 3 , 1 and C 3 , 2 C_{3,2} C 3 , 2 ) and eliminate every answer choice that lacks the required segment state. Repeat the check on additional segments and completed rows; a rule must account for all the supplied evidence before it is accepted.
4. Latin-Square Attribute Permutation ( Üçlü Dağılım Kuralı )
When the three figures in each row do not share superimposable line segments, the matrix is governed by Attribute Permutation . The designer defines 3 or 4 independent visual attributes, each having exactly 3 possible states across a 3 × 3 3 \times 3 3 × 3 grid:
Layer 1 — Outer Frame Shape: { Circle , Triangle , Square } \{\text{Circle}, \text{Triangle}, \text{Square}\} { Circle , Triangle , Square }
Layer 2 — Inner Shading / Fill: { White (Empty) , Black (Solid) , Cross-Hatched } \{\text{White (Empty)}, \text{Black (Solid)}, \text{Cross-Hatched}\} { White (Empty) , Black (Solid) , Cross-Hatched }
Layer 3 — Central Symbol Orientation: { 0 ∘ (Up) , 90 ∘ (Right) , 180 ∘ (Down) } \{0^\circ \text{ (Up)}, 90^\circ \text{ (Right)}, 180^\circ \text{ (Down)}\} { 0 ∘ (Up) , 9 0 ∘ (Right) , 18 0 ∘ (Down) }
Layer 4 — Element Count or Size: { 1 , 2 , 3 } \{1, 2, 3\} { 1 , 2 , 3 } inner dots or { Small , Medium , Large } \{\text{Small}, \text{Medium}, \text{Large}\} { Small , Medium , Large }
In each row and each column, every state appears once and only once . To find C 3 , 3 C_{3,3} C 3 , 3 , inspect Row 3 one layer at a time: if C 3 , 1 C_{3,1} C 3 , 1 is a White Circle and C 3 , 2 C_{3,2} C 3 , 2 is a Black Triangle, then C 3 , 3 C_{3,3} C 3 , 3 must be a Cross-Hatched Square.
Row-Column Equivalence & Diagonal Shifts ( Çapraz Kayma )
Because Set Union ( ∪ \cup ∪ ), Set Intersection ( ∩ \cap ∩ ), and Boolean XOR ( ⊕ \oplus ⊕ ) are both commutative and associative , a well-formed superposition matrix often works both across rows and down columns simultaneously: C 3 , 3 = C 3 , 1 ⊕ C 3 , 2 = C 1 , 3 ⊕ C 2 , 3 C_{3,3} = C_{3,1} \oplus C_{3,2} = C_{1,3} \oplus C_{2,3} C 3 , 3 = C 3 , 1 ⊕ C 3 , 2 = C 1 , 3 ⊕ C 2 , 3
In Attribute Permutation matrices, watch how the three states shift from Row 1 to Row 2 to Row 3:
Left-Shift Cyclic Permutation ( A , B , C → B , C , A → C , A , B A, B, C \to B, C, A \to C, A, B A , B , C → B , C , A → C , A , B ): Every element steps one cell to the left as you move down a row, so the anti-diagonals contain identical elements ( C 1 , 3 = C 2 , 2 = C 3 , 1 C_{1,3} = C_{2,2} = C_{3,1} C 1 , 3 = C 2 , 2 = C 3 , 1 ).
Right-Shift Cyclic Permutation ( A , B , C → C , A , B → B , C , A A, B, C \to C, A, B \to B, C, A A , B , C → C , A , B → B , C , A ): Every element steps one cell to the right as you move down a row, so the main diagonal contains identical elements ( C 1 , 1 = C 2 , 2 = C 3 , 3 C_{1,1} = C_{2,2} = C_{3,3} C 1 , 1 = C 2 , 2 = C 3 , 3 ). Only after verifying the cyclic-shift rule should you infer that C 3 , 3 C_{3,3} C 3 , 3 shares the diagonal attribute; two matching cells alone do not prove it.
Summary Reference Table: Matrix Logic Operators
Matrix Rule Turkish Exam Term Mathematical Formula Binary Signature ( C 1 , C 2 ) → C 3 (C_1, C_2) \to C_3 ( C 1 , C 2 ) → C 3 Visual Density Cue
Set Union (OR) Birleşim C 3 = C 1 ∪ C 2 C_3 = C_1 \cup C_2 C 3 = C 1 ∪ C 2 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 1 , ( 1 , 1 ) → 1 (1,0)\to 1,\; (0,1)\to 1,\; (1,1)\to 1 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 1 , ( 1 , 1 ) → 1 C 3 C_3 C 3 is the densest cell in each row
Set Intersection (AND) Kesişim C 3 = C 1 ∩ C 2 C_3 = C_1 \cap C_2 C 3 = C 1 ∩ C 2 ( 1 , 0 ) → 0 , ( 0 , 1 ) → 0 , ( 1 , 1 ) → 1 (1,0)\to 0,\; (0,1)\to 0,\; (1,1)\to 1 ( 1 , 0 ) → 0 , ( 0 , 1 ) → 0 , ( 1 , 1 ) → 1 C 3 C_3 C 3 is the sparsest cell in each row
Symmetric Difference (XOR) Aynı Olanlar Silinir C 3 = C 1 ⊕ C 2 C_3 = C_1 \oplus C_2 C 3 = C 1 ⊕ C 2 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 1 , ( 1 , 1 ) → 0 (1,0)\to 1,\; (0,1)\to 1,\; (1,1)\to 0 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 1 , ( 1 , 1 ) → 0 Shared strokes vanish; unique strokes remain
Equivalence (XNOR) Farklı Olanlar Silinir C 3 = C 1 ⊕ C 2 ‾ C_3 = \overline{C_1 \oplus C_2} C 3 = C 1 ⊕ C 2 ( 1 , 0 ) → 0 , ( 0 , 1 ) → 0 , ( 1 , 1 ) → 1 , ( 0 , 0 ) → 1 (1,0)\to 0,\; (0,1)\to 0,\; (1,1)\to 1,\; (0,0)\to 1 ( 1 , 0 ) → 0 , ( 0 , 1 ) → 0 , ( 1 , 1 ) → 1 , ( 0 , 0 ) → 1 Matching states (present or absent) become drawn
Set Subtraction Fark İşlemi C 3 = C 1 ∖ C 2 C_3 = C_1 \setminus C_2 C 3 = C 1 ∖ C 2 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 0 , ( 1 , 1 ) → 0 (1,0)\to 1,\; (0,1)\to 0,\; (1,1)\to 0 ( 1 , 0 ) → 1 , ( 0 , 1 ) → 0 , ( 1 , 1 ) → 0 C 2 C_2 C 2 acts as an eraser on C 1 C_1 C 1
Attribute Permutation Üçlü Dağılım Kuralı { S 1 , S 2 , S 3 } \{S_1, S_2, S_3\} { S 1 , S 2 , S 3 } per row/col 1 of each state per row and column 3 distinct shapes, fills, and angles
- Worked Examples
- Worked Example 1: Hybrid Outer-Frame XOR and Inner-Dot Intersection
Problem: Each cell of a 3 × 3 3 \times 3 3 × 3 matrix is built inside a square template with four outer edges ( Top T, Bottom B, Left L, Right R \text{Top T, Bottom B, Left L, Right R} Top T, Bottom B, Left L, Right R ) and four corner dots ( NW, NE, SW, SE \text{NW, NE, SW, SE} NW, NE, SW, SE ).
Row 1:
C 1 , 1 C_{1,1} C 1 , 1 has edges { T, L, B } \{\text{T, L, B}\} { T, L, B } and dots { NW, NE, SW } \{\text{NW, NE, SW}\} { NW, NE, SW } .
C 1 , 2 C_{1,2} C 1 , 2 has edges { T, R, B } \{\text{T, R, B}\} { T, R, B } and dots { NE, SW, SE } \{\text{NE, SW, SE}\} { NE, SW, SE } .
C 1 , 3 C_{1,3} C 1 , 3 has edges { L, R } \{\text{L, R}\} { L, R } and dots { NE, SW } \{\text{NE, SW}\} { NE, SW } .
Row 2:
C 2 , 1 C_{2,1} C 2 , 1 has edges { T, L } \{\text{T, L}\} { T, L } and dots { NW, SE } \{\text{NW, SE}\} { NW, SE } .
C 2 , 2 C_{2,2} C 2 , 2 has edges { L, B, R } \{\text{L, B, R}\} { L, B, R } and dots { NW, NE, SE } \{\text{NW, NE, SE}\} { NW, NE, SE } .
C 2 , 3 C_{2,3} C 2 , 3 has edges { T, B, R } \{\text{T, B, R}\} { T, B, R } and dots { NW, SE } \{\text{NW, SE}\} { NW, SE } .
Row 3:
C 3 , 1 C_{3,1} C 3 , 1 has edges { T, R, B } \{\text{T, R, B}\} { T, R, B } and dots { NW, NE, SW } \{\text{NW, NE, SW}\} { NW, NE, SW } .
C 3 , 2 C_{3,2} C 3 , 2 has edges { L, R, B } \{\text{L, R, B}\} { L, R, B } and dots { NW, SW, SE } \{\text{NW, SW, SE}\} { NW, SW, SE } .
Determine the exact outer edges and corner dots of the missing cell C 3 , 3 C_{3,3} C 3 , 3 .
Step-by-Step Solution:
Diagnose Layer 1 (Outer Edges): In Row 1, edges T \text{T} T and B \text{B} B appear in both C 1 , 1 C_{1,1} C 1 , 1 and C 1 , 2 C_{1,2} C 1 , 2 , and both vanish in C 1 , 3 C_{1,3} C 1 , 3 , leaving only non-overlapping edges { L, R } \{\text{L, R}\} { L, R } . In Row 2, shared edge L \text{L} L vanishes, leaving { T, B, R } \{\text{T, B, R}\} { T, B, R } . Thus, the outer edges follow Boolean XOR ( E 3 = E 1 ⊕ E 2 E_3 = E_1 \oplus E_2 E 3 = E 1 ⊕ E 2 ).
Diagnose Layer 2 (Corner Dots): In Row 1, C 1 , 1 C_{1,1} C 1 , 1 has { NW, NE, SW } \{\text{NW, NE, SW}\} { NW, NE, SW } and C 1 , 2 C_{1,2} C 1 , 2 has { NE, SW, SE } \{\text{NE, SW, SE}\} { NE, SW, SE } ; C 1 , 3 C_{1,3} C 1 , 3 keeps only { NE, SW } \{\text{NE, SW}\} { NE, SW } , which are the dots common to both cells. Row 2 confirms Set Intersection ( D 3 = D 1 ∩ D 2 D_3 = D_1 \cap D_2 D 3 = D 1 ∩ D 2 ).
Compute C 3 , 3 C_{3,3} C 3 , 3 :
Outer Edges (XOR): { T, R, B } ⊕ { L, R, B } = { T, L } \{\text{T, R, B}\} \oplus \{\text{L, R, B}\} = \{\text{T, L}\} { T, R, B } ⊕ { L, R, B } = { T, L } (since shared edges R \text{R} R and B \text{B} B cancel out).
Corner Dots (AND): { NW, NE, SW } ∩ { NW, SW, SE } = { NW, SW } \{\text{NW, NE, SW}\} \cap \{\text{NW, SW, SE}\} = \{\text{NW, SW}\} { NW, NE, SW } ∩ { NW, SW, SE } = { NW, SW } .
Conclusion: C 3 , 3 C_{3,3} C 3 , 3 consists of the Top and Left edges { T, L } \{\text{T, L}\} { T, L } and the two left-side corner dots { NW, SW } \{\text{NW, SW}\} { NW, SW } .
Worked Example 2: Multi-Layer Attribute Permutation & Diagonal Shift
Problem: A 3 × 3 3 \times 3 3 × 3 matrix displays composite icons with four attributes: Outer Shape, Inner Fill, Arrow Direction, and Perimeter Tick Count:
Row 1: C 1 , 1 = ( Circle, White, ↑ , 2 ticks ) C_{1,1} = (\text{Circle, White, } \uparrow, 2\text{ ticks}) C 1 , 1 = ( Circle, White, ↑ , 2 ticks ) ; C 1 , 2 = ( Square, Striped, → , 4 ticks ) C_{1,2} = (\text{Square, Striped, } \rightarrow, 4\text{ ticks}) C 1 , 2 = ( Square, Striped, → , 4 ticks ) ; C 1 , 3 = ( Hexagon, Black, ↓ , 6 ticks ) C_{1,3} = (\text{Hexagon, Black, } \downarrow, 6\text{ ticks}) C 1 , 3 = ( Hexagon, Black, ↓ , 6 ticks ) .
Row 2: C 2 , 1 = ( Square, Black, ↓ , 6 ticks ) C_{2,1} = (\text{Square, Black, } \downarrow, 6\text{ ticks}) C 2 , 1 = ( Square, Black, ↓ , 6 ticks ) ; C 2 , 2 = ( Hexagon, White, ↑ , 2 ticks ) C_{2,2} = (\text{Hexagon, White, } \uparrow, 2\text{ ticks}) C 2 , 2 = ( Hexagon, White, ↑ , 2 ticks ) ; C 2 , 3 = ( Circle, Striped, → , 4 ticks ) C_{2,3} = (\text{Circle, Striped, } \rightarrow, 4\text{ ticks}) C 2 , 3 = ( Circle, Striped, → , 4 ticks ) .
Row 3: C 3 , 1 = ( Hexagon, Striped, → , 4 ticks ) C_{3,1} = (\text{Hexagon, Striped, } \rightarrow, 4\text{ ticks}) C 3 , 1 = ( Hexagon, Striped, → , 4 ticks ) ; C 3 , 2 = ( Circle, Black, ↓ , 6 ticks ) C_{3,2} = (\text{Circle, Black, } \downarrow, 6\text{ ticks}) C 3 , 2 = ( Circle, Black, ↓ , 6 ticks ) ; C 3 , 3 = ? C_{3,3} = \text{?} C 3 , 3 = ?
Step-by-Step Solution:
Scan Row 3 by Attribute Layer:
Outer Shape: Row 3 already contains Hexagon \text{Hexagon} Hexagon and Circle \text{Circle} Circle , so C 3 , 3 C_{3,3} C 3 , 3 must be a Square .
Inner Fill: Row 3 already contains Striped \text{Striped} Striped and Black \text{Black} Black , so C 3 , 3 C_{3,3} C 3 , 3 must be White .
Arrow Direction: Row 3 already contains → \rightarrow → and ↓ \downarrow ↓ , so C 3 , 3 C_{3,3} C 3 , 3 must point Up ( ↑ \uparrow ↑ ) .
Tick Count: Row 3 already contains 4 4 4 and 6 6 6 ticks, so C 3 , 3 C_{3,3} C 3 , 3 must have 2 2 2 ticks .
Diagonal Shortcut Verification: Notice that C 1 , 1 C_{1,1} C 1 , 1 and C 2 , 2 C_{2,2} C 2 , 2 both share ( White, ↑ , 2 ticks ) (\text{White, } \uparrow, 2\text{ ticks}) ( White, ↑ , 2 ticks ) along the main diagonal, immediately confirming that C 3 , 3 = ( Square, White, ↑ , 2 ticks ) C_{3,3} = (\text{Square, White, } \uparrow, 2\text{ ticks}) C 3 , 3 = ( Square, White, ↑ , 2 ticks ) .
Original Visual Matrix: Track One Slot at a Time
Each icon uses three fixed slots. Filled circles mean present and hollow circles mean absent. The third icon in each row retains exactly the slots present in only one of the first two icons.
- Row First icon Second icon Third icon
- 1 ● ● ○ ○ ● ● ● ○ ●
- 2 ● ○ ● ● ● ○ ○ ● ●
3 ○ ● ● ● ○ ● ?
For Row 3, compare each slot: absent/present becomes filled; present/absent becomes filled; present/present becomes hollow. The result is ● ● ○. This is an XOR example with a stated rule, not a claim that all official matrices use XOR. A colour-mapping diagram may instead encode how overlapping groups cover particular positions; keep those membership rules separate from row-wise set operations.
Review the Method
Independent hybrid matrices can apply separate rules to edges and dots. Attribute-group diagrams instead map group membership to colours; verify the demonstrated rule at each position.
Group Membership and Colour Mapping
Some visual rules concern the groups covering a position , rather than the superposition of two whole icons. First identify each outlined group, then record which groups include each cell. Colours can encode no membership, one membership or an overlap. Do not assume that red means XOR or that a colour carries a fixed meaning outside the demonstrated diagram.
In this original example, a three-by-three grid has Group A covering rows 1–2 and columns 1–2. Group B covers rows 2–3 and columns 2–3. The stated colour rule is white for zero groups, red for exactly one group, and blue for two groups.
- Position Column 1 Column 2 Column 3
- Row 1 Red: A Red: A White: none
- Row 2 Red: A Blue: A and B Red: B
- Row 3 White: none Red: B Red: B
The central cell belongs to both groups, so it is blue. The top-right and bottom-left cells belong to neither group, so they are white. All six remaining cells belong to exactly one group and are red. Check the count: each group has four cells, but the shared centre was counted twice, so their union contains seven cells. Seven coloured cells plus two white cells account for all nine positions.
If a later diagram moves Group B, preserve the colour rule and recompute memberships at the new positions; do not move all old red cells together as if they formed a rigid shape. If the rule is not stated but illustrated, compare cells with known zero, single and overlapping membership before inferring its mapping. This connects set membership to a visual attribute transformation while keeping it distinct from row-wise XOR.