Study guide

4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

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.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

Key Takeaways Explain This Topic AI

In any n × n n \times n n × n Latin Square or Sudoku variant, every symbol appears once per row and column; Sudoku adds a specified sub-block condition, with each complete line of numbers { 1 , … , n } \{1, \dots, n\} { 1 , … , n } summing to S n = n ( n + 1 ) 2 S_n = \frac{n(n+1)}{2} S n ​ = 2 n ( n + 1 ) ​ ( S 4 = 10 S_4 = 10 S 4 ​ = 10 , S 5 = 15 S_5 = 15 S 5 ​ = 15 , S 6 = 21 S_6 = 21 S 6 ​ = 21 )

Never fill an entire Latin or Sudoku grid on the TR-YÖS; use Intersection Elimination (Row-Column-Box Cross-Out) and Hidden Singles to isolate only the target cells ( X , Y X, Y X , Y ) requested by the prompt

In any 3 × 3 3 \times 3 3 × 3 arithmetic Magic Square ('Sihirli Kare'), the magic constant M M M equals three times the center cell ( M = 3 c M = 3c M = 3 c ), the sum of all 9 cells equals 9 c 9c 9 c , and every opposite pair across the center sums to 2 c 2c 2 c

The Corner-Edge Mean Law states that any corner cell of a 3 × 3 3 \times 3 3 × 3 magic square equals the arithmetic mean of the two non-adjacent edge midpoints ( Corner = Edge 1 + Edge 2 2 \text{Corner} = \frac{\text{Edge}_1 + \text{Edge}_2}{2} Corner = 2 Edge 1 ​ + Edge 2 ​ ​ ), solving sparse magic squares even when M M M and c c c are unknown

In N × N N \times N N × N Skyscraper ('Apartmanlar') grids, a marginal clue of 1 1 1 forces the tallest building N N N into the immediately adjacent border cell, while a clue of N N N forces the ascending sequence ( 1 , 2 , … , N ) (1, 2, \dots, N) ( 1 , 2 , … , N ) along that line

Last updated: October 2026

Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

Quick Strategy: For these independent grid exercises, begin with the requested target cells; solve additional cells if the target requires them. For Latin Squares and Sudoku variants, cross out symbols along the row and column intersecting the target cell X X X . For 3 × 3 3 \times 3 3 × 3 Magic Squares ( Sihirli Kareler ), memorize two algebraic identities that bypass trial-and-error completely: the magic sum is always three times the center cell ( M = 3 c M = 3c M = 3 c ) , and every corner cell is the average of the two non-adjacent edge cells ( Corner = Edge 1 + Edge 2 2 \text{Corner} = \frac{\text{Edge}_1 + \text{Edge}_2}{2} Corner = 2 Edge 1 ​ + Edge 2 ​ ​ ) .

Latin Squares & Shape/Number Sudoku ( 4 × 4 4 \times 4 4 × 4 , 5 × 5 5 \times 5 5 × 5 , 6 × 6 6 \times 6 6 × 6 )

An n × n n \times n n × n Latin Square is a grid filled with n n n distinct symbols—typically digits { 1 , 2 , … , n } \{1, 2, \dots, n\} { 1 , 2 , … , n } , letters { A , B , … } \{A, B, \dots\} { A , B , … } , or geometric shapes { △ , □ , ◯ , ◊ , ⋆ } \{\triangle, \square, \bigcirc, \lozenge, \star\} { △ , □ , ◯ , ◊ , ⋆ } —such that every symbol appears exactly once in each row and once in each column .

In Sudoku Variants , the grid imposes one additional regional constraint:

4 × 4 4 \times 4 4 × 4 Mini-Sudoku: Partitioned into four bold 2 × 2 2 \times 2 2 × 2 sub-boxes , each containing { 1 , 2 , 3 , 4 } \{1, 2, 3, 4\} { 1 , 2 , 3 , 4 } .

6 × 6 6 \times 6 6 × 6 Semi-Sudoku: Partitioned into six bold 2 × 3 2 \times 3 2 × 3 rectangular blocks , each containing { 1 , 2 , 3 , 4 , 5 , 6 } \{1, 2, 3, 4, 5, 6\} { 1 , 2 , 3 , 4 , 5 , 6 } .

Diagonal Latin Square ( Köşegen Sudoku ): Both main diagonals must also contain all n n n symbols without repetition.

Target-Focused Deduction Techniques

Because the exam only asks for the value of one or two labeled cells ( X X X or X + Y X + Y X + Y ), filling every empty square wastes valuable time. Instead, use two rapid elimination methods:

Intersection Elimination (Naked Single / Kesişim Elemesi ): To find the symbol in cell ( r , c ) (r, c) ( r , c ) , take the union of all symbols already visible in Row r r r , Column c c c , and (if applicable) its bold sub-block . Whenever n − 1 n - 1 n − 1 distinct symbols appear in that combined peer group, the single missing symbol is forced into ( r , c ) (r, c) ( r , c ) .

Hidden Single ( Gizli Tekli ) via Column/Row Blocking: Suppose you need cell ( r , c ) (r, c) ( r , c ) , and Row r r r still has three empty cells: ( r , c 1 ) , ( r , c 2 ) , ( r , c 3 ) (r, c_1), (r, c_2), (r, c_3) ( r , c 1 ​ ) , ( r , c 2 ​ ) , ( r , c 3 ​ ) . If symbol S S S already appears in Column c 1 c_1 c 1 ​ and in Column c 2 c_2 c 2 ​ , then S S S is blocked from both ( r , c 1 ) (r, c_1) ( r , c 1 ​ ) and ( r , c 2 ) (r, c_2) ( r , c 2 ​ ) and must go into ( r , c 3 ) (r, c_3) ( r , c 3 ​ ) —even if you have no idea what the other two cells in Row r r r contain!

The Line-Sum Invariant: In any numerical n × n n \times n n × n Latin square using { 1 , 2 , … , n } \{1, 2, \dots, n\} { 1 , 2 , … , n } , the sum of every complete row, column, or sub-block is fixed: S n = n ( n + 1 ) 2 ⟹ S 4 = 10 , S 5 = 15 , S 6 = 21 S_n = \frac{n(n+1)}{2} \implies S_4 = 10,\quad S_5 = 15,\quad S_6 = 21 S n ​ = 2 n ( n + 1 ) ​ ⟹ S 4 ​ = 10 , S 5 ​ = 15 , S 6 ​ = 21

3 × 3 3 \times 3 3 × 3 Arithmetic Magic Squares ( Sihirli Kareler )

A 3 × 3 3 \times 3 3 × 3 Magic Square is a numerical grid in which all 3 rows, all 3 columns, and both 3-cell main diagonals sum to the exact same Magic Constant M M M ( Sihirli Toplam ) : [ a 1 , 1 a 1 , 2 a 1 , 3 a 2 , 1 c a 2 , 3 a 3 , 1 a 3 , 2 a 3 , 3 ] \begin{bmatrix} a_{1,1} & a_{1,2} & a_{1,3} \\ a_{2,1} & c & a_{2,3} \\ a_{3,1} & a_{3,2} & a_{3,3} \end{bmatrix} ​ a 1 , 1 ​ a 2 , 1 ​ a 3 , 1 ​ ​ a 1 , 2 ​ c a 3 , 2 ​ ​ a 1 , 3 ​ a 2 , 3 ​ a 3 , 3 ​ ​ ​

Instead of setting up nine messy linear equations, use two golden theorems that simplify a specified 3-by-3 magic-square problem.

Golden Formula 1: The Center Cell & Opposite-Pair Law ( M = 3 c M = 3c M = 3 c )

Add the four lines that pass directly through the center cell c = a 2 , 2 c = a_{2,2} c = a 2 , 2 ​ (Row 2, Column 2, Main Diagonal, and Anti-Diagonal): Row 2 + Col 2 + Diag 1 + Diag 2 = 4 M \text{Row}_2 + \text{Col}_2 + \text{Diag}_1 + \text{Diag}_2 = 4M Row 2 ​ + Col 2 ​ + Diag 1 ​ + Diag 2 ​ = 4 M

Every outer cell is included exactly once in this sum, while the center cell c c c is included four times (three extra times beyond the sum of all 9 cells, which equals 3 M 3M 3 M ): 3 M + 3 c = 4 M ⟹ M = 3 c and c = M 3 3M + 3c = 4M \implies M = 3c \quad \text{and} \quad c = \frac{M}{3} 3 M + 3 c = 4 M ⟹ M = 3 c and c = 3 M ​

Total Grid Sum: The sum of all 9 numbers in the magic square is always 3 M = 9 c 3M = 9c 3 M = 9 c .

Symmetric Opposite Pairs: Since every line through the center sums to M = 3 c M = 3c M = 3 c , any two cells symmetrically opposite across the center sum to 2 c 2c 2 c (so c c c is the exact arithmetic mean of every opposite pair): a 1 , 1 + a 3 , 3 = a 1 , 3 + a 3 , 1 = a 1 , 2 + a 3 , 2 = a 2 , 1 + a 2 , 3 = 2 c a_{1,1} + a_{3,3} = a_{1,3} + a_{3,1} = a_{1,2} + a_{3,2} = a_{2,1} + a_{2,3} = 2c a 1 , 1 ​ + a 3 , 3 ​ = a 1 , 3 ​ + a 3 , 1 ​ = a 1 , 2 ​ + a 3 , 2 ​ = a 2 , 1 ​ + a 2 , 3 ​ = 2 c

Golden Formula 2: The Corner-Edge Mean Law ( Köşe-Kenar Ortalaması )

What if a TR-YÖS problem gives you a sparse magic square where neither M M M nor the center cell c c c is known ? Use the Corner-Edge Mean Law :

Every corner cell equals the arithmetic mean of the two non-adjacent edge midpoints (the two edge cells that do not share a row or column with that corner): a 1 , 1 = a 3 , 2 + a 2 , 3 2 , a 1 , 3 = a 3 , 2 + a 2 , 1 2 , a 3 , 1 = a 1 , 2 + a 2 , 3 2 , a 3 , 3 = a 1 , 2 + a 2 , 1 2 a_{1,1} = \frac{a_{3,2} + a_{2,3}}{2}, \quad a_{1,3} = \frac{a_{3,2} + a_{2,1}}{2}, \quad a_{3,1} = \frac{a_{1,2} + a_{2,3}}{2}, \quad a_{3,3} = \frac{a_{1,2} + a_{2,1}}{2} a 1 , 1 ​ = 2 a 3 , 2 ​ + a 2 , 3 ​ ​ , a 1 , 3 ​ = 2 a 3 , 2 ​ + a 2 , 1 ​ ​ , a 3 , 1 ​ = 2 a 1 , 2 ​ + a 2 , 3 ​ ​ , a 3 , 3 ​ = 2 a 1 , 2 ​ + a 2 , 1 ​ ​

Quick Proof: In Row 3 and Column 3, a 3 , 1 + a 3 , 2 + a 3 , 3 = M a_{3,1} + a_{3,2} + a_{3,3} = M a 3 , 1 ​ + a 3 , 2 ​ + a 3 , 3 ​ = M and a 1 , 3 + a 2 , 3 + a 3 , 3 = M a_{1,3} + a_{2,3} + a_{3,3} = M a 1 , 3 ​ + a 2 , 3 ​ + a 3 , 3 ​ = M . Adding these gives ( a 3 , 1 + a 1 , 3 ) + a 3 , 2 + a 2 , 3 + 2 a 3 , 3 = 2 M (a_{3,1} + a_{1,3}) + a_{3,2} + a_{2,3} + 2a_{3,3} = 2M ( a 3 , 1 ​ + a 1 , 3 ​ ) + a 3 , 2 ​ + a 2 , 3 ​ + 2 a 3 , 3 ​ = 2 M . Since the anti-diagonal gives a 3 , 1 + a 1 , 3 = 2 c a_{3,1} + a_{1,3} = 2c a 3 , 1 ​ + a 1 , 3 ​ = 2 c and a 1 , 1 + a 3 , 3 = 2 c ⟹ a 3 , 3 = 2 c − a 1 , 1 a_{1,1} + a_{3,3} = 2c \implies a_{3,3} = 2c - a_{1,1} a 1 , 1 ​ + a 3 , 3 ​ = 2 c ⟹ a 3 , 3 ​ = 2 c − a 1 , 1 ​ , substituting and using 2 M = 6 c 2M = 6c 2 M = 6 c yields: 2 c + a 3 , 2 + a 2 , 3 + 4 c − 2 a 1 , 1 = 6 c ⟹ 2 a 1 , 1 = a 3 , 2 + a 2 , 3 2c + a_{3,2} + a_{2,3} + 4c - 2a_{1,1} = 6c \implies 2a_{1,1} = a_{3,2} + a_{2,3} 2 c + a 3 , 2 ​ + a 2 , 3 ​ + 4 c − 2 a 1 , 1 ​ = 6 c ⟹ 2 a 1 , 1 ​ = a 3 , 2 ​ + a 2 , 3 ​

Skyscraper ( Apartmanlar ) & Marginal Sum-Clue Grids

In a Skyscraper ( Apartmanlar ) puzzle, an N × N N \times N N × N Latin square contains building heights { 1 , 2 , … , N } \{1, 2, \dots, N\} { 1 , 2 , … , N } in every row and column. Numbers placed outside the border indicate how many buildings are visible when looking along that row or column from that side (taller buildings hide all shorter buildings behind them).

Clue = 1 = 1 = 1 : The tallest building N N N must stand in the very first cell immediately adjacent to the clue (blocking all N − 1 N - 1 N − 1 buildings behind it).

Clue = N = N = N : Every single building is visible, forcing the strictly ascending sequence ( 1 , 2 , 3 , … , N ) (1, 2, 3, \dots, N) ( 1 , 2 , 3 , … , N ) starting from the clue.

Clue = 2 = 2 = 2 with N N N at the Far End: If building N N N is in the last cell of a row, then whichever building stands in the first cell must hide every intermediate building before N N N , forcing N − 1 N - 1 N − 1 into the first cell .

Extreme Pair ( 1 , 2 ) (1, 2) ( 1 , 2 ) Across a Row: If the left clue is 1 1 1 and the right clue is 2 2 2 , then N N N is in the leftmost cell and N − 1 N - 1 N − 1 is in the rightmost cell!

In Marginal Sum-Clue / Mine-Count Grids , numbers along the top and left borders specify either the sum of values inside shaded cells or the count of black squares/stars in that row or column. Always start with rows/columns whose clue is 0 0 0 (cross out the entire line) or equals the full line capacity, then propagate forced cells into intersecting lines.

Grid Constraint & Magic Square Reference Table

Grid Puzzle Type Core Algebraic / Logical Rule Instant Shortcut Formula Primary Exam Application

n × n n \times n n × n Latin / Sudoku Each symbol { 1 , … , n } \{1,\dots,n\} { 1 , … , n } once per row, col, (and box) Line sum S n = n ( n + 1 ) 2 S_n = \frac{n(n+1)}{2} S n ​ = 2 n ( n + 1 ) ​ Cross out row/col/box peers of target cell X X X

3 × 3 3 \times 3 3 × 3 Magic Square (Center) All rows, cols, and diagonals sum to M M M M = 3 c M = 3c M = 3 c and Total = 9 c \text{Total} = 9c Total = 9 c Find M M M from center c c c , or c c c from M M M

3 × 3 3 \times 3 3 × 3 Magic Square (Pairs) Opposite cells across center are symmetric a opp1 + a opp2 = 2 c a_{\text{opp1}} + a_{\text{opp2}} = 2c a opp1 ​ + a opp2 ​ = 2 c Find opposite cell when center c c c is known

3 × 3 3 \times 3 3 × 3 Magic Square (Corner) Corner relates to the 2 non-adjacent edges Corner = Edge 1 + Edge 2 2 \text{Corner} = \frac{\text{Edge}_1 + \text{Edge}_2}{2} Corner = 2 Edge 1 ​ + Edge 2 ​ ​ Solve sparse grids when M M M and c c c are unknown

N × N N \times N N × N Skyscraper Grid Taller numbers hide shorter ones behind them Clue 1 ⟹ N 1 \implies N 1 ⟹ N first; Clue N ⟹ ( 1 , … , N ) N \implies (1,\dots,N) N ⟹ ( 1 , … , N ) Place N N N and N − 1 N-1 N − 1 first, then finish as Latin square

  • Worked Examples
  • Worked Example 1: Solving a Sparse 3 × 3 3 \times 3 3 × 3 Magic Square in 10 Seconds

Problem: In a 3 × 3 3 \times 3 3 × 3 arithmetic magic square where every row, column, and main diagonal has the same sum M M M , only three entries are given:

  • Top-Middle Edge a 1 , 2 = 19 a_{1,2} = 19 a 1 , 2 ​ = 19
  • Middle-Left Edge a 2 , 1 = 17 a_{2,1} = 17 a 2 , 1 ​ = 17
  • Bottom-Left Corner a 3 , 1 = 16 a_{3,1} = 16 a 3 , 1 ​ = 16

Find the Bottom-Right Corner a 3 , 3 a_{3,3} a 3 , 3 ​ , the Center Cell c = a 2 , 2 c = a_{2,2} c = a 2 , 2 ​ , and the Magic Constant M M M .

Step-by-Step Solution:

Find Bottom-Right Corner a 3 , 3 a_{3,3} a 3 , 3 ​ via the Corner-Edge Mean Law: The two non-adjacent edge midpoints opposite to a 3 , 3 a_{3,3} a 3 , 3 ​ are a 1 , 2 = 19 a_{1,2} = 19 a 1 , 2 ​ = 19 and a 2 , 1 = 17 a_{2,1} = 17 a 2 , 1 ​ = 17 : a 3 , 3 = a 1 , 2 + a 2 , 1 2 = 19 + 17 2 = 18 a_{3,3} = \frac{a_{1,2} + a_{2,1}}{2} = \frac{19 + 17}{2} = 18 a 3 , 3 ​ = 2 a 1 , 2 ​ + a 2 , 1 ​ ​ = 2 19 + 17 ​ = 18

Find Middle-Right Edge a 2 , 3 a_{2,3} a 2 , 3 ​ via the Corner-Edge Mean Law on a 3 , 1 a_{3,1} a 3 , 1 ​ : The corner a 3 , 1 = 16 a_{3,1} = 16 a 3 , 1 ​ = 16 is the average of its two non-adjacent edges a 1 , 2 = 19 a_{1,2} = 19 a 1 , 2 ​ = 19 and a 2 , 3 a_{2,3} a 2 , 3 ​ : 16 = 19 + a 2 , 3 2 ⟹ 19 + a 2 , 3 = 32 ⟹ a 2 , 3 = 13 16 = \frac{19 + a_{2,3}}{2} \implies 19 + a_{2,3} = 32 \implies a_{2,3} = 13 16 = 2 19 + a 2 , 3 ​ ​ ⟹ 19 + a 2 , 3 ​ = 32 ⟹ a 2 , 3 ​ = 13

Find Center c c c and Magic Constant M M M : Since a 2 , 1 = 17 a_{2,1} = 17 a 2 , 1 ​ = 17 and a 2 , 3 = 13 a_{2,3} = 13 a 2 , 3 ​ = 13 are opposite across the center: 2 c = a 2 , 1 + a 2 , 3 = 17 + 13 = 30 ⟹ c = 15 , M = 3 c = 45 2c = a_{2,1} + a_{2,3} = 17 + 13 = 30 \implies c = 15, \quad M = 3c = 45 2 c = a 2 , 1 ​ + a 2 , 3 ​ = 17 + 13 = 30 ⟹ c = 15 , M = 3 c = 45

(Indeed, the complete magic square of consecutive integers 11 … 19 11 \dots 19 11 … 19 is [ 12 , 19 , 14 ; 17 , 15 , 13 ; 16 , 11 , 18 ] [12, 19, 14;\; 17, 15, 13;\; 16, 11, 18] [ 12 , 19 , 14 ; 17 , 15 , 13 ; 16 , 11 , 18 ] .)

Worked Example 2: 4 × 4 4 \times 4 4 × 4 Skyscraper & Latin Square Deduction

Problem: A 4 × 4 4 \times 4 4 × 4 Skyscraper grid uses building heights { 1 , 2 , 3 , 4 } \{1, 2, 3, 4\} { 1 , 2 , 3 , 4 } in each row and column.

The Top clues (looking down Columns 1 to 4) are: Col 1 = 4 , Col 2 = 1 , Col 3 = 2 , Col 4 = 2 \text{Col 1} = 4,\; \text{Col 2} = 1,\; \text{Col 3} = 2,\; \text{Col 4} = 2 Col 1 = 4 , Col 2 = 1 , Col 3 = 2 , Col 4 = 2 .

The Right clue looking left along Row 2 is 1 1 1 .

Determine the exact building height in cell ( 2 , 3 ) (2, 3) ( 2 , 3 ) (Row 2, Column 3).

Step-by-Step Solution:

Apply the Top Clue 4 4 4 on Column 1: A clue of 4 4 4 forces Column 1 from top to bottom to be ( 1 , 2 , 3 , 4 ) T (1, 2, 3, 4)^T ( 1 , 2 , 3 , 4 ) T , so a 1 , 1 = 1 , a 2 , 1 = 2 , a 3 , 1 = 3 , a 4 , 1 = 4 a_{1,1} = 1,\; a_{2,1} = 2,\; a_{3,1} = 3,\; a_{4,1} = 4 a 1 , 1 ​ = 1 , a 2 , 1 ​ = 2 , a 3 , 1 ​ = 3 , a 4 , 1 ​ = 4 .

Apply the Clue 1 1 1 s to Place All Four 4 4 4 s:

Top clue Col 2 = 1 ⟹ a 1 , 2 = 4 \text{Col 2} = 1 \implies a_{1,2} = 4 Col 2 = 1 ⟹ a 1 , 2 ​ = 4 .

Right clue on Row 2 = 1 ⟹ a 2 , 4 = 4 = 1 \implies a_{2,4} = 4 = 1 ⟹ a 2 , 4 ​ = 4 .

Since 4 4 4 is already placed in Columns 1, 2, and 4 (at a 4 , 1 , a 1 , 2 , a 2 , 4 a_{4,1}, a_{1,2}, a_{2,4} a 4 , 1 ​ , a 1 , 2 ​ , a 2 , 4 ​ ), the remaining 4 4 4 in Column 3 must sit in Row 3: a 3 , 3 = 4 a_{3,3} = 4 a 3 , 3 ​ = 4 .

Solve Row 2: In Row 2, we already have a 2 , 1 = 2 a_{2,1} = 2 a 2 , 1 ​ = 2 and a 2 , 4 = 4 a_{2,4} = 4 a 2 , 4 ​ = 4 , leaving { 1 , 3 } \{1, 3\} { 1 , 3 } for a 2 , 2 a_{2,2} a 2 , 2 ​ and a 2 , 3 a_{2,3} a 2 , 3 ​ . In Row 1, since a 1 , 1 = 1 a_{1,1} = 1 a 1 , 1 ​ = 1 and a 1 , 2 = 4 a_{1,2} = 4 a 1 , 2 ​ = 4 , the remaining cells a 1 , 3 a_{1,3} a 1 , 3 ​ and a 1 , 4 a_{1,4} a 1 , 4 ​ must be { 2 , 3 } \{2, 3\} { 2 , 3 } . Because the Top clue for Column 3 is 2 2 2 and a 3 , 3 = 4 a_{3,3} = 4 a 3 , 3 ​ = 4 , cell a 2 , 3 a_{2,3} a 2 , 3 ​ cannot be taller than a 1 , 3 a_{1,3} a 1 , 3 ​ (otherwise a 1 , 3 , a 2 , 3 , 4 a_{1,3}, a_{2,3}, 4 a 1 , 3 ​ , a 2 , 3 ​ , 4 would all be visible from the top of Column 3, giving 3 visible buildings instead of 2). Choosing a 2 , 3 = 3 a_{2,3} = 3 a 2 , 3 ​ = 3 would force a 1 , 3 = 2 < 3 < 4 a_{1,3} = 2 < 3 < 4 a 1 , 3 ​ = 2 < 3 < 4 , which violates the clue of 2 2 2 . Therefore, a 2 , 3 = 1 a_{2,3} = 1 a 2 , 3 ​ = 1 !

Review the Method

In N × N N \times N N × N Skyscraper ('Apartmanlar') grids, a marginal clue of 1 1 1 forces the tallest building N N N into the immediately adjacent border cell, while a clue of N N N forces the ascending sequence ( 1 , 2 , … , N ) (1, 2, \dots, N) ( 1 , 2 , … , N ) along that line