Logic Masters Deutschland e.V.

Snack 1: Renban skyscrapers 9x9

(Published on 2. December 2010, 13:00 by RobertBe)

Fill each cell inside the grid with a digit from 1 to 9. Every digit must appear once in any row or column. Every digit inside the grid represents a building with a specific height. The digits outside the grid (which are also to be determined by you) indicate the number of buildings visible from that direction. A building is visible if all the other buildings are lower than it. Cells with the same color must contain consecutive (all different) digits, even when they are not connected.

Solution code: The diagonals, first from top left to bottom right, then from top right to bottom left

Last changed on on 3. December 2010, 14:41

Solved by rimodech, pokerke, Alex, Luigi, relzzup, Rollie, Rollo, Semax, pin7guin, CHalb, Toastbrot, pwahs, Statistica, ffricke, Le Ahcim, ibag, Laje6, Richard, Mody, derwolf23, martin1456, saskia-daniela, ... matter, marcmees, sf2l, mango, tuace, Joe Average, KlausRG, jessica6, Matt, zhergan, Thomster, amitsowani, Danielle, bismarck, Julianl, NikolaZ, Uhu, zuzanina, Realshaggy, Raistlen, Jordan Timm
Full list

Comments

on 12. February 2023, 17:02 by RobertBe
@Dugong: there is also a renban condition on the grey cells. Your solution would have 224 for this renban, which is invalid.

on 24. June 2019, 19:45 by Danielle
Very funny!

on 13. January 2019, 18:39 by Thomster
Acht Jahre des Ärgerns sind mit dem heutigen Tage vorbei... xD

Last changed on 3. December 2010, 15:01

on 3. December 2010, 14:41 by RobertBe
Changed due to a question regarding the meaning of consecutive. Meant is of course three or nine different numbers, like 2,3,4 of 6,8,7 or ...

on 3. December 2010, 14:19 by ibag
Schöne Idee!

on 3. December 2010, 10:21 by Statistica
Lustig!

on 2. December 2010, 20:31 by CHalb
Robert, it seems you've done some studies after my Hochhausblöcke. Fine!

on 2. December 2010, 20:05 by pin7guin
Witzige Idee! Danke :)

Difficulty:1
Rating:81 %
Solved:82 times
Observed:5 times
ID:0000UP

Enter solution

Solution code:

Login