Hochhausblöcke 1 (WPC 2019 Leftover)
(Published on 28. October 2019, 13:20 by CHalb)
Skyscraper Cluster 1 (WPC 2019 Leftover)
Enter numbers into the grid, so that each region of size N×N contains numbers from 1 to N, and within a region each number appears exactly once in each row and column. These numbers represent skyscrapers of the corresponding height.
Numbers bordering another grid are also clues for the adjacent grid, they indicate how many skyscrapers can be seen in the respective row or column from the respective direction. However, only clues in yellow cells are correct, clues in white cells are always incorrect. If a corner cell borders two different grids, its clue number must be correct for both adjacent grids if the cell is yellow, or incorrect for both adjacent grids if the cell is white. Numbers outside the grid are correct clues for the adjacent grid. All clue numbers refer only to the adjacent grid, only visible skyscrapers in the adjacent grid are counted.
Solution code: The two main diagonals of the whole diagram, starting top left and top right
Solved by Luigi, zorant, marcmees, tuace, Realshaggy, jessica6, r45, adam001, Statistica, dm_litv, cornuto, Uhu, Joe Average, Zzzyxas, Matt, Nothere, Dandelo, jirk, pokerke, saskia-daniela, flaemmchen, ... skywalker, Alex, sf2l, Mathi, NikolaZ, Kekes, HaSe, lutzreimer, bob, Lucx, johanna, Quetzal, pirx, ildiko, Thomas Meier, marsigel, misko, Greg, Joo M.Y, SudokuExplorer, Voyager, Ulistef, RobertBe
Comments
on 14. December 2019, 14:42 by Lucx
Der wechselseitige Bezug der Randfelder macht das Rätsel interessant. Hat mir gut gefallen.
Last changed on 28. October 2019, 15:10on 28. October 2019, 15:09 by jessica6
Ich hänge immer noch an den Hochhausblöcken von tuace's Krypto-Finale. Dagegen war das hier total einfach.