Negative Lines Series #5 - 10-4 (Negative Renban)
(Published on 15. April 2024, 17:17 by Mikemerin)
Part of the Negative Lines Series
A quick easy puzzle trying to make the grid as small as possible with this negative Renban constraint. The title comes from the killer sum (10) and the size of the grid (4).
---
Latin Square: place 1-4 in each row and column in the 4x4 grid.
Renban: for numbers 2 and 3, row N (horizontal) and column N (vertical) both have lines N long in the listed orientations. Lines have consecutive digits in any order, can overlap, and all lines are given.
Little Killer: numbers along the diagonal sum to 10.
Skyscraper: the extra cell in column 3 gives the number of buildings seen, with larger buildings hiding smaller ones.
---
Solve in Sudokupad (includes solution) or F-Puzzles
This ruleset is similar to a Kropki puzzle with a negative constraint, where if "all dots are given" and none are in the grid, adjacent cells cannot be consecutive or be in a 2:1 ratio. For a general hint regarding this ruleset (warning, for a grid this small it spoils much of it): putting digits 132 in R3C1-3 would break the puzzle as there is now a run of 3 consecutive digits in any order.
A hint if you're stuck at the end: Remember the skyscraper cell is a part of column 3, so how does that work with the negative constraint?
-----
A quick easy puzzle trying to make the grid as small as possible with this negative Renban constraint. The title comes from the killer sum (10) and the size of the grid (4).
---
Latin Square: place 1-4 in each row and column in the 4x4 grid.
Renban: for numbers 2 and 3, row N (horizontal) and column N (vertical) both have lines N long in the listed orientations. Lines have consecutive digits in any order, can overlap, and all lines are given.
Little Killer: numbers along the diagonal sum to 10.
Skyscraper: the extra cell in column 3 gives the number of buildings seen, with larger buildings hiding smaller ones.
---
Solve in Sudokupad (includes solution) or F-Puzzles
This ruleset is similar to a Kropki puzzle with a negative constraint, where if "all dots are given" and none are in the grid, adjacent cells cannot be consecutive or be in a 2:1 ratio. For a general hint regarding this ruleset (warning, for a grid this small it spoils much of it): putting digits 132 in R3C1-3 would break the puzzle as there is now a run of 3 consecutive digits in any order.
A hint if you're stuck at the end: Remember the skyscraper cell is a part of column 3, so how does that work with the negative constraint?
-----
Solution code: Row 4 and Column 4 (8 digits)
Solved by SKORP17, Woody03130, Dermerlin, CcmarvMD, Ploctypus, zhangjinyang, StefanSch, sujoyku, PippoForte
Comments
on 26. April 2024, 17:03 by sujoyku
Thank you for this fun little puzzle, Mikemerin! I find the wording of the rules a little misleading. I first thought there have to be 2 (resp. 3) cell long renbans in rows/columns 2 (resp. 3). Is there a negation missing in the renban rule?
on 26. April 2024, 15:15 by StefanSch
Die Regeln wären besser verständlich, wenn man direkt schreibt: In Reihe 2 und Spalte 2 gibt es keine Renban-Linie der Länge 2 und in Reihe 3 und Spalte 3 gibt es keine Renban-Linie der Länge 3.
