Tower View · The puzzle notebook

Tower View practice: place the tallest towers, then uncover the hidden orders.

Try a third board with no outside clue of four. Locate tallest towers, resolve two hidden height orders, and reveal the complete reasoning, answer and six replay checkpoints.

This final series exercise asks you to solve a different board before opening the explanation. There is no outside clue of 4 to hand you an entire increasing line. Instead, locate the tallest towers, work out which smaller towers must stay hidden, and combine two directions to decide an order. The challenge is to explain why the order is forced, not just produce a full grid.

Load the hidden-orders challenge

Choose Practice this example beside the article, or Load challenge board in the game. Confirm Edits 0 and this clue map. It is the third arrangement in the existing five-board collection, different from the first-view and paired-views boards. There is no extra puzzle bank or new game. Rows run top to bottom and columns left to right; bottom clues look upward.

       TOP: 2 1 2 3
LEFT 2    · · · ·    3 RIGHT
LEFT 1    · · · ·    3 RIGHT
LEFT 2    · · · ·    1 RIGHT
LEFT 3    · · · ·    2 RIGHT
    BOTTOM: 3 3 1 2

You can use paper for tentative deductions and the game for committed heights. Select a cell, then use Height 1–4 or type its digit. The selection itself adds no edit. Retry this board clears entries on unchanged clues, so you can test a branch and restart without searching for this layout again.

Try these tasks before opening the answers

  1. Find all four height-4 cells. For each, name the outside clue that forces it.
  2. Find two height-3 cells without listing all 24 row permutations. Use a view of 2 toward a line whose far end is already 4.
  3. Resolve row 2. Explain where its 3 must go, then why the two smaller heights have only one possible order.
  4. Finish the crossings and audit all four edges. Give a reason for the first height of row 4.

For a separate direction check, compare 4 3 1 2 and 4 3 2 1 from the right. Both use every height once and start with 4 from the left. Which has a right view of 3, and why does the other fail? Write down the actual visible heights, not just the count.

Keep the panels below closed while trying. This is the third lesson's challenge, not a calibrated difficulty rating or a minimum-move contest. Getting stuck is a reason to inspect one deduction at a time.

Answer 1: four tallest towers and two hidden threes

Translate a view of one into a position

The tallest height is 4. If a clue sees only one tower, the nearest cell must contain 4; any smaller first tower would also leave the later 4 visible. The top clue 1 over column 2 gives R1C2=4. The left clue 1 on row 2 gives R2C1=4. The right clue 1 on row 3 gives R3C4=4. The bottom clue 1 under column 3 gives R4C3=4. These four entries occupy different rows and columns.

R1: · 4 · ·
R2: 4 · · ·
R3: · · · 4
R4: · · 4 ·

Two views can force a tower that is not four

Row 3 ends with 4 and must show only two towers from the left. The final 4 contributes one visible tower. The three cells before it must therefore contribute exactly one. Since those cells contain 1,2,3, their first height must be 3 so that it hides both smaller towers. Thus R3C1=3, with 1 and 2 still unresolved at R3C2/R3C3. The two surviving row orders are 3 1 2 4 and 3 2 1 4.

Column 3 has the same directional pattern: top clue 2, bottom clue 1, and a known 4 at the bottom. Reading downward forces its first height to be 3, so R1C3=3. R2C3 and R3C3 must hold 1 and 2 in some order. This is a statement about which towers are hidden, not a sum of heights. You now have six entries and ten blank cells.

R1: · 4 3 ·
R2: 4 · · ·
R3: 3 · · 4
R4: · · 4 ·
Answer 2: resolve the middle row without guessing

Use a crossing to locate three, then inspect the small pair

Row 2 starts with 4 and has remaining heights 1,2,3. Its third cell is already restricted to 1 or 2 by column 3, so R2C3 cannot be 3. Could its last cell be 3? Looking from the right would see that 3 immediately, then only the final 4: a count of 2 instead of the required 3. Therefore R2C4 cannot be 3 either. The only position left is R2C2=3.

The remaining two cells must be 1 and 2. If you choose R2C3=2 and R2C4=1, the right-to-left sequence is 1 2 3 4. All four towers would be visible. The required clue is 3, so that order fails. The opposite ordering gives the row 4 3 1 2; from the right you see 2, then 3, then 4, while 1 stays hidden behind 2. Enter R2C3=1 and R2C4=2.

After adding these three row-2 entries to the six-entry checkpoint, there are nine edits and seven blanks. You have used both a column restriction and a view from the opposite edge. An untested ordering would not justify either small height.

Reproduce and diagnose the wrong small-pair order

If you want to test the rejected branch, retry, enter the four 4s and the two forced 3s from Answer 1, then put row 2 as 4 3 2 1. There are nine entries. Check towers should report seven blanks, zero rows with repeated heights, zero columns with repeated heights, and one mismatched complete-line clue: row 2 from the right sees 4 towers, but needs 3. This is a visibility mistake, not a repeated-height mistake. Retry once more before replaying the correct route.

Answer 3: finish the board, audit the views and check your replay

Let the solved row settle the remaining crossings

Column 3 now reads 3 1 · 4, so R3C3=2. Row 3 already has 3,2,4; its remaining cell R3C2 must be 1. Column 2 then reads 4 3 1 ·, forcing R4C2=2.

Row 4 is now · 2 4 ·, with 1 and 3 missing. Its left view must be 3. Starting it with 3 would create 3 2 4 1, which exposes only 3 and 4 from the left. That is a view of 2, so it fails. Start with 1 instead: 1 2 4 3 exposes 1,2,4, as required. Enter R4C1=1 and R4C4=3.

Column 1 contains · 4 3 1, leaving R1C1=2. Row 1 then needs R1C4=1. The full answer is:

R1: 2 4 3 1
R2: 4 3 1 2
R3: 3 1 2 4
R4: 1 2 4 3

Each row and column contains all four heights once. Left views are 2,1,2,3; right views are 3,3,1,2. Top views are 2,1,2,3; bottom views are 3,3,1,2. Matching one pair of edges does not excuse the other pair: count each direction separately, even though this board happens to have equal row and column clue sequences.

Replay with six checkpoints

  1. Place the four tallest towers: 4 edits, 12 blanks.
  2. Add R3C1=3 and R1C3=3: 6 edits, 10 blanks.
  3. Complete row 2: 9 edits, 7 blanks.
  4. Set R3C3=2 and R3C2=1: 11 edits, 5 blanks.
  5. Set R4C2=2, R4C1=1 and R4C4=3: 14 edits, 2 blanks.
  6. Set R1C1=2 and R1C4=1: 16 edits, no blanks.

These counts describe a replay that enters each height once. Corrections may increase Edits without invalidating your answer. Filling the last cell does not automatically win: select Check towers. A successful check locks height entries; Undo last edit reopens the board with fifteen entries, and Retry clears it on the same clues. Load challenge board restores this exact arrangement. New puzzle advances to the next prepared board, while refreshing the challenge address reloads its clues without preserving your entries.

Self-check the reasoning, not just the filled cells

You should now be able to explain three different ideas: why a view of one fixes the nearest 4; why a view of two toward a far-end 4 forces a nearer 3 but can leave 1/2 unresolved; and why combining a crossing restriction with the opposite view settles that small pair. If your explanation is only that the final grid matches the picture, retry and justify those three deductions before filling the rest.

The supplied challenge has exactly one solution, independently verified among all 576 four-by-four Latin grids. That is a fact about this clue set, not a promise that arbitrary homemade clues are solvable or unique. The game's current-entry checks are also limited: incomplete lines remain pending, and the checker does not search for future completions. Use deductions to justify commitments and an explicit final check to confirm the finished board.

Rule reference

[1] Simon Tatham, Portable Puzzle Collection, Towers manual, consulted November 14, 2026. It supplies the common visibility rules. This prepared clue arrangement, implementation, challenge, explanations and independent verification are original; no affiliation is claimed.